The DOI matches its Crossref record; 8 of the 9 references it cites were found in a registry or an index.
An analysis of approximations for maximizing submodular set functions—II
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“When per-pool KV capacity is slack (the common case), M 1 is the only binding constraint and the combinatorial (lazy) greedy deployed on the fast path returns A g with G ( A g ) ≥ 1 2 G ⋆ [54]”
From Janus: Joint Prefill/Decode Disaggregation with KV-Cache-Aware Multi-Cloud Routing for Edge-Adjacent LLM Serving (2026) · cites this paper as [54]
In the citing paper
“Submodular maximization (from the classical greedy analysis of Nemhauser-Wolsey-Fisher [12]) underpins cache and content placement [20]; the matroid-constrained guarantees we invoke are due to Fisher-Nemhauser-Wolsey [54] (combinatorial greedy, 1 2 ), Calinescu-Chekuri-Pál-Vondrák [53] (continuous greedy, 1 -1 /e ), and, for the matroid-plus-knapsack case, Lee-Mirrokni-Nagarajan-Sviridenko [62] (”
From Janus: Joint Prefill/Decode Disaggregation with KV-Cache-Aware Multi-Cloud Routing for Edge-Adjacent LLM Serving (2026) · cites this paper as [54]
Citations
Cites
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Self-citationP-Complete Approximation Problems
Sahni, S. K., & Gonzalez, T. F. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,725
Cornuéjols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
Self-citationLectures on Applied Mathematics
Bungartz, H., Hoppe, R. H. W., & Zenger, C. (2000) · Springer eBooks · doi:10.1007/978-3-642-59709-1 · Cited by 772
Submodular Functions, Matroids, and Certain Polyhedra
Edmonds, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36478-1_2 · Cited by 543
An Analysis of the Greedy Heuristic for Independence Systems
Körte, B., & Hausmann, D. (1978) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70322-4 · Cited by 192
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
Chandra, A. K., & Wong, C. K. (1975) · SIAM Journal on Computing · doi:10.1137/0204021 · Cited by 126
Introduction to the Theory of Matroids
Randow, R. (1975) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-48292-2 · Cited by 37
Flagged first, then by citations
1 of the 9 references couldn’t be matched to a known paper.
Research works printed but not linked: 2
- J. Edmonds, “Matroid partition”, in: G.B. Dantzig and A.M. Veinott, eds., Mathematics of the decision sciences, Lectures in Applied Mathematics, 11, (Am. Math. Soc. Providence, RI, 1968) pp. 333–345.
- T.A. Jenkyns, “The efficiency of the “greedy” algorithm”, in: Proceedings of the 7th S.E. Conference on combinatorics, graph theory and computing (Utilitas Mathematica, Winnipeg, 1976) pp. 341–350.
Cited by
Sorted by citations
Items 101–200 of 586
Submodular Stochastic Probing on Matroids
Adamczyk, M., Sviridenko, M. I., & Ward, J. (2016) · Mathematics of Operations Research · doi:10.1287/moor.2015.0766 · Cited by 41
Bertsimas, D., & Teo, C. (1998) · Operations Research · doi:10.1287/opre.46.4.503 · Cited by 41
Sparse Sampling for Inverse Problems With Tensors
Ortiz-Jiménez, G., Coutiño, M., Chepuri, S. P., & Leus, G. J. T. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2914879 · Cited by 40
A Multi-Trip Task Assignment for Early Target Inspection in Squads of Aerial Drones
Bartolini, N., Coletta, A., Maselli, G., & Khalifeh, A. F. (2020) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.2994529 · Cited by 40
Approximation Algorithms for the Team Orienteering Problem
Xu, W., Xu, Z., Peng, J., Liang, W., Liu, T., Jia, X., & Das, S. K. (2020) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom41043.2020.9155343 · Cited by 40
On k-Column Sparse Packing Programs
Bansal, N. N., Korula, N., Nagarajan, V, & Srinivasan, A. (2009) · Cited by 40
Constrained submodular maximization via greedy local search
Sarpatwar, K., Schieber, B., & Shachnai, H. (2018) · Operations Research Letters · doi:10.1016/j.orl.2018.11.002 · Cited by 39
Multi-Sensor Next-Best-View Planning as Matroid-Constrained Submodular Maximization
Lauri, M., Pajarinen, J., Peters, J., & Frintrop, S. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3007445 · Cited by 39
Parametric monotone function maximization with matroid constraints
Gong, S., Nong, Q., Liu, W., & Fang, Q. (2019) · Journal of Global Optimization · doi:10.1007/s10898-019-00800-2 · Cited by 38
Clark, A., Alomair, B., Bushnell, L. G., & Poovendran, R. (2017) · IEEE Control Systems · doi:10.1109/mcs.2017.2743518 · Cited by 37
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks
Hashemi, A., Ghasemi, M., Vikalo, H., & Topcu, U. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431563 · Cited by 38
Adaptive Influence Blocking: Minimizing the Negative Spread by Observation-Based Policies
Shi, Q., Wang, C., Ye, D., Chen, J., Feng, Y., & Chen, C. (2019) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00135 · Cited by 38
Cost-Effective Social Media Influencer Marketing
Han, X. G., Wang, L., & Fan, W. (2022) · INFORMS journal on computing · doi:10.1287/ijoc.2022.1246 · Cited by 37
Efficient Submodular Function Maximization under Linear Packing Constraints
Azar, Y., & Gamzu, I. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31594-7_4 · Cited by 37
Improved Approximations for k-Exchange Systems
Feldman, M., Naor, J. S., Schwartz, R., & Ward, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23719-5_66 · Cited by 37
Computation and incentives in combinatorial public projects
Buchfuhrer, D., Schapira, M., & Singer, Y. (2010) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/1807342.1807348 · Cited by 36
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
Huang, C.-C., Kakimura, N., & Yoshida, Y. (2019) · Algorithmica · doi:10.1007/s00453-019-00628-y · Cited by 36
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Lee, J., Sviridenko, M. I., & Vondrák, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03685-9_19 · Cited by 36
Parallelizing greedy for submodular set function maximization in matroids and beyond
Chekuri, C., & Quanrud, K. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316406 · Cited by 35
Wu, W., Zhang, Z., & Du, D. (2018) · Journal of the Operations Research Society of China · doi:10.1007/s40305-018-0233-3 · Cited by 35
Sensor Assignment Algorithms to Improve Observability While Tracking Targets
Zhou, L., & Tokekar, P. (2019) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2920749 · Cited by 35
Seshadhri, C., & Vondrák, J. (2012) · Algorithmica · doi:10.1007/s00453-012-9719-2 · Cited by 35
Precoder Design for Physical Layer Multicasting
Zhu, H., Prasad, N., & Rangarajan, S. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2210710 · Cited by 35
The Impact of Information in Distributed Submodular Maximization
Grimsman, D., Ali, M. S., Hespanha, J. P., & Marden, J. R. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2018.2889005 · Cited by 34
Distributed Submodular Maximization on Partition Matroids for Planning on Large Sensor Networks
Corah, M., & Michael, N. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619396 · Cited by 34
String Submodular Functions With Curvature Constraints
Zhang, Z., Chong, E. K. P., Pezeshki, A., & Moran, W. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2440566 · Cited by 33
A budgeted maximum multiple coverage model for cybersecurity planning and management
Zheng, K., Albert, L. A., Luedtke, J., & Towle, E. (2019) · IISE Transactions · doi:10.1080/24725854.2019.1584832 · Cited by 33
Robust Server Placement for Edge Computing
Lu, D., Qu, Y., Wu, F., Dai, H., Dong, C., & Chen, G. (2020) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps47924.2020.00038 · Cited by 33
Optimal BS Deployment and User Association for 5G Millimeter Wave Communication Networks
Zhang, Y., Dai, L., & Wong, E. W. M. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3044288 · Cited by 32
Edge-Weighted Online Bipartite Matching
Fahrbach, M., Huang, Z., Tao, R., & Zadimoghaddam, M. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00046 · Cited by 33
Zhou, H., Ji, Y., Li, J., & Zhao, B. (2014) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2014.6952480 · Cited by 32
SAMPLING AND RECONSTRUCTION OF SIGNALS ON PRODUCT GRAPHS
Ortiz-Jiménez, G., Coutiño, M., Chepuri, S. P., & Leus, G. J. T. (2018) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2018.8646609 · Cited by 32
Konar, A., & Sidiropoulos, N. D. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2863654 · Cited by 32
Shen, S., Ren, Y., Ju, Y., Wang, X., Wang, W., & Leung, V. C. M. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3229444 · Cited by 36
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
Anshelevich, E., Chakrabarty, D., Hate, A., & Swamy, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10631-6_98 · Cited by 32
1 String Submodular Functions with Curvature ConstraintsPreprint
Zhang, Z., Member, S., Chong, E. K. P., Pezeshki, A., & Moran, W. (2016) · Cited by 32
Redundant Robot Assignment on Graphs with Uncertain Edge Costs
Prorok, A. (2019) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-05816-6_22 · Cited by 31
Blockchain Enabled AI Marketplace: The Price You Pay for Trust
Sarpatwar, K., Ganapavarapu, V. S., Shanmugam, K., Rahman, A., & Vaculín, R. (2019) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2019.00345 · Cited by 31
Actuator Placement Under Structural Controllability Using Forward and Reverse Greedy Algorithms
Guo, B., Karaca, O., Summers, T. H., & Kamgarpour, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3044284 · Cited by 31
Scheduling Algorithms for Multicarrier Wireless Data Systems
Andrews, M., & Zhang, L. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2064175 · Cited by 31
Maximizing Sensor Lifetime via Multi-node Partial-Charging on Sensors
Liu, J., Peng, J., Xu, W., Liang, W., Liu, T., Peng, X., Xu, Z., Li, Z., & Jia, X. (2022) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3200070 · Cited by 30
Tian, Y., Khosoussi, K., & How, J. P. (2020) · The International Journal of Robotics Research · doi:10.1177/0278364920948594 · Cited by 30
Approximative Algorithms for Discrete Optimization Problems
Körte, B. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70820-3 · Cited by 30
A digraph fourier transform with spread frequency components
Shafipour, R., Khodabakhsh, A., Mateos, G., & Nikolova, E. (2017) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2017.8309026 · Cited by 29
Multi-Objective Multi-Agent Planning for Discovering and Tracking Multiple Mobile Objects
Nguyen, H. V., Vo, B., Vo, B.-T., Rezatofighi, H., & Ranasinghe, D. C. (2024) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2024.3423755 · Cited by 29
On k-Column Sparse Packing Programs
Bansal, N., Korula, N., Nagarajan, V., & Srinivasan, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13036-6_28 · Cited by 29
Distributed Attack-Robust Submodular Maximization for Multirobot Planning
Zhou, L., Tzoumas, V., Pappas, G. J., & Tokekar, P. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3161765 · Cited by 29
An Approximation Algorithm for Risk-Averse Submodular Optimization
Zhou, L., & Tokekar, P. (2020) · Springer proceedings in advanced robotics · doi:10.1007/978-3-030-44051-0_9 · Cited by 29
An Approximation Algorithm for Joint Caching and Recommendations in Cache Networks
Tsigkari, D., & Spyropoulos, T. (2022) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2022.3150961 · Cited by 29
Distributed Attack-Robust Submodular Maximization for Multi-Robot Planning
Zhou, L., Tzoumas, V., Pappas, G. J., & Tokekar, P. (2020) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra40945.2020.9197243 · Cited by 29
Jorgensen, S., Chen, R. H., Milam, M. B., & Pavone, M. (2017) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8206450 · Cited by 29
Enumerative Methods in Integer Programming
Spielberg, K. (1979) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70347-9 · Cited by 29
Maximizing the Diversity of Exposure in a Social Network
Matakos, A., Aslay, Ç., Galbrun, E., & Gionis, A. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3038711 · Cited by 28
Fair and Representative Subset Selection from Data Streams
Wang, Y., Fabbri, F., & Mathioudakis, M. (2021) · International World Wide Web Conference (WWW) · doi:10.1145/3442381.3449799 · Cited by 28
Graph Neural Networks for Decentralized Multi-Robot Target Tracking
Zhou, L., Sharma, V. D., Li, Q., Prorok, A., Ribeiro, A., Tokekar, P., & Kumar, V. (2022) · IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR) · doi:10.1109/ssrr56537.2022.10018712 · Cited by 28
Relay Placement in Wireless Networks: Minimizing Communication Cost
Nikolov, M., & Haas, Z. J. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2523984 · Cited by 28
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
Korula, N., Mirrokni, V., & Zadimoghaddam, M. (2018) · SIAM Journal on Computing · doi:10.1137/15m1051142 · Cited by 28
Parallel Task Routing for Crowdsourcing
Bragg, J., Kolobov, A., Mausam, M., & Weld, D. S. (2014) · Proceedings of the AAAI Conference on Human Computation and Crowdsourcing · doi:10.1609/hcomp.v2i1.13170 · Cited by 27
Edge-Weighted Online Bipartite Matching
Fahrbach, M., Huang, Z., Tao, R., & Zadimoghaddam, M. (2022) · Journal of the ACM · doi:10.1145/3556971 · Cited by 27
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
Gupta, A., Nagarajan, V., & Ravi, R. (2015) · ACM Transactions on Algorithms · doi:10.1145/2746226 · Cited by 27
Shioura, A. (2009) · Discrete Mathematics Algorithms and Applications · doi:10.1142/s1793830909000063 · Cited by 27
Video Object Segmentation via Global Consistency Aware Query Strategy
Luo, B., Li, H., Meng, F., Wu, Q., & Huang, C. (2017) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2017.2671447 · Cited by 26
Maximizing the Diversity of Exposure in a Social Network
Aslay, Ç., Matakos, A., Galbrun, E., & Gionis, A. (2018) · Proceedings · doi:10.1109/icdm.2018.00102 · Cited by 26
Frequency Domain Packet Scheduling with MIMO for 3GPP LTE Downlink
Xu, Y., Yang, H., Ren, F., Lin, C., & Shen, X. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.022113.120678 · Cited by 26
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
Ma, T., Tang, B., & Wang, Y. (2015) · Theory of Computing Systems · doi:10.1007/s00224-015-9642-4 · Cited by 25
Matroid Matching: The Power of Local Search
Lee, J., Sviridenko, M. I., & Vondrák, J. (2013) · SIAM Journal on Computing · doi:10.1137/11083232x · Cited by 24
Word Alignment via Submodular Maximization over Matroids
Lin, H. Z., & Bilmes, J. (2011) · Cited by 25
The Role of Information in Distributed Resource Allocation
Marden, J. R. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2553363 · Cited by 25
Submodular Maximization Meets Streaming: Matchings, Matroids, and More
Chakrabarti, A., & Kale, S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07557-0_18 · Cited by 25
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization in linear time
Tang, S. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.11.007 · Cited by 24
Truthful Mechanisms via Greedy Iterative Packing
Chekuri, C., & Gamzu, I. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03685-9_5 · Cited by 24
Online Submodular Welfare Maximization
Korula, N., Mirrokni, V., & Zadimoghaddam, M. (2015) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2746539.2746626 · Cited by 24
Near optimal bounded route association for drone-enabled rechargeable WSNs
Wu, T., Yang, P., Dai, H., Li, P., & Rao, X. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.07.004 · Cited by 24
Scalable Lattice Influence Maximization
Chen, W., Wu, R., & Yu, Z. (2020) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2020.2998777 · Cited by 24
A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
Li, W., & Vondrák, J. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs52979.2021.00012 · Cited by 24
Rigid Network Design Via Submodular Set Function Optimization
Shames, I., & Summers, T. H. (2015) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2480247 · Cited by 24
Efficient minimization of higher order submodular functions using monotonic Boolean functions
Ramalingam, S., Russell, C., Ladický, Ľ., & Torr, P. H. S. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2016.11.022 · Cited by 24
Maximizing a Class of Utility Functions Over the Vertices of a Polytope
Atamtürk, A., & Gómez, A. (2017) · Operations Research · doi:10.1287/opre.2016.1570 · Cited by 23
Mobility-Aware and Interest-Predicted Caching Strategy Based on IoT Data Freshness in D2D Networks
Zhao, X., & Zhu, Q. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3033552 · Cited by 23
Joint service placement and request routing in mobile edge computing
Yuan, B., Guo, S., & Wang, Q. (2021) · Ad Hoc Networks · doi:10.1016/j.adhoc.2021.102543 · Cited by 23
Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and ApplicationsPreprint
Wei, K., Iyer, R., Wang, S., Bai, W., & Bilmes, J. (2015) · arXiv (Cornell University) · Cited by 23
Dynamic Network Delay Cartography
Rajawat, K., Dall’Anese, E., & Giannakis, G. B. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2311802 · Cited by 22
Exploiting submodular value functions for scaling up active perception
Satsangi, Y., Whiteson, S., Oliehoek, F. A., & Spaan, M. T. J. (2017) · Autonomous Robots · doi:10.1007/s10514-017-9666-5 · Cited by 22
Inferring the Strength of Social Ties
Rozenshtein, P., Tatti, N., & Gionis, A. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098199 · Cited by 22
Capacity Constrained Influence Maximization in Social Networks
Zhang, S., Huang, Y., Sun, J., Lin, W., Xiao, X., & Tang, B. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599267 · Cited by 22
Migration as Submodular Optimization
Gölz, P., & Procaccia, A. D. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.3301549 · Cited by 22
Astute Video Transmission for Geographically Dispersed Devices in Visual IoT Systems
Ji, W., Duan, L., Huang, X., & Chai, Y. (2020) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2020.3009745 · Cited by 22
Deterministic (½ + ε )-Approximation for Submodular Maximization over a Matroid
Buchbinder, N., Feldman, M., & Garg, M. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975482.16 · Cited by 22
BUSH: Empowering large-scale MU-MIMO in WLANs with hybrid beamforming
Chen, Z., Zhang, X., Wang, S., Xu, Y., Xiong, J., & Wang, X. (2017) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2017.8056988 · Cited by 21
Impact of information in greedy submodular maximization
Grimsman, D., Ali, M. S., Hespanha, J. P., & Marden, J. R. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264080 · Cited by 21
Submodular optimization problems and greedy strategies: A survey
Liu, Y., Chong, E. K. P., Pezeshki, A., & Zhang, Z. (2020) · Discrete Event Dynamic Systems · doi:10.1007/s10626-019-00308-7 · Cited by 21
Maximizing Network Throughput in Heterogeneous UAV Networks
Li, S., Li, J., Xiang, C., Xu, W., Peng, J., Wang, Z., Liang, W., Yao, X., Jia, X., & Das, S. K. (2024) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2023.3347557 · Cited by 21
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
Buchbinder, N., & Feldman, M. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649630 · Cited by 21
Scalable Histopathological Image Analysis via Active Learning
Zhu, Y., Zhang, S., Liu, W., & Metaxas, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10443-0_47 · Cited by 21
Maximizing Monotone Submodular Functions over the Integer Lattice
Soma, T., & Yoshida, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-33461-5_27 · Cited by 21
Radar network topology optimization for joint target position and velocity estimation
Ivashko, I. M., Leus, G. J. T., & Yarovoy, A. G. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.07.010 · Cited by 21
Service Placement for Detecting and Localizing Failures Using End-to-End Observations
He, T., Bartolini, N., Khamfroush, H., Kim, I., Ma, L., & Porta, T. L. (2016) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2016.21 · Cited by 21
Submodular Optimization for Coupled Task Allocation and Intermittent Deployment Problems
Liu, J., & Williams, R. K. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2925301 · Cited by 21
A sub-modular receding horizon solution for mobile multi-agent persistent monitoring
Rezazadeh, N., & Kia, S. S. (2021) · Automatica · doi:10.1016/j.automatica.2020.109460 · Cited by 21
Huang, C.-C., & Kakimura, N. (2021) · Algorithmica · doi:10.1007/s00453-020-00786-4 · Cited by 21
Metadata
- Authors
- Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A.
- Affiliations
- University of Pennsylvania (US)
- UCLouvain (BE)
- Venue
- Mathematical Programming Studies
- Publisher
- Springer Berlin Heidelberg
- Published
- 1978
- Pages
- 73-87
- ISSN
- 0303-3929 (ISSN-L)
- OpenAlex
- W2757107770
- Cited by
- 589
- References
- 9
- Citations by year
- 2026: 15 · 2025: 28 · 2024: 30 · 2023: 45 · 2022: 57 · 2021: 35 · 2020: 53 · 2019: 40 · 2018: 37 · 2017: 35 · 2016: 27 · 2015: 35 · 2014: 20 · 2013: 29 · 2012: 18
- FWCI
- 7.98
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Mathematical programming studies (publishedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Game Theory and Voting Systems
- Keywords
- submodular functions, maximization, approximation algorithms, greedy algorithm, linear programming relaxation, matroid intersection, worst-case bounds, nondecreasing functions
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
