The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Submodular with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1978-1984 (16) 1985-1991 (15) 1992-1995 (16) 1996-1998 (17) 1999-2000 (22) 2001-2002 (21) 2003 (15) 2004-2005 (21) 2006-2007 (37) 2008 (35) 2009 (47) 2010 (44) 2011 (63) 2012 (50) 2013 (71) 2014 (61) 2015 (97) 2016 (118) 2017 (140) 2018 (179) 2019 (185) 2020 (200) 2021 (218) 2022 (212) 2023 (213) 2024 (49)
Publication types (Num. hits)
article(1177) incollection(4) inproceedings(954) phdthesis(27)
Venues (Conferences, Journals, ...)
CoRR(672) ICML(69) SODA(58) AAAI(53) NIPS(52) NeurIPS(46) Math. Program.(43) AISTATS(41) Discret. Appl. Math.(33) Theor. Comput. Sci.(31) J. Comb. Optim.(29) STOC(28) FOCS(27) CDC(25) IPCO(25) Math. Oper. Res.(23) More (+10 of total 360)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 135 occurrences of 89 keywords

Results
Found 2162 publication records. Showing 2162 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
162Stanislav Zivný, David A. Cohen, Peter G. Jeavons The Expressive Power of Binary Submodular Functions. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Decomposition of submodular functions, Pseudo-Boolean optimisation, Submodular function minimisation, Min-Cut
154Jan Vondrák Optimal approximation for the submodular welfare problem in the value oracle model. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF combinatorial auctions, matroids, submodular functions
132Uriel Feige, Vahab S. Mirrokni, Jan Vondrák Maximizing Non-Monotone Submodular Functions. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
127Jon Lee 0001, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko Non-monotone submodular maximization under matroid and knapsack constraints. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, matroids, knapsacks, submodular functions
106Zoya Svitkina, Lisa Fleischer Submodular Approximation: Sampling-based Algorithms and Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
102Dániel Marx Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
92Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata 0001, Vahab S. Mirrokni Approximating submodular functions everywhere. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
92Stanislav Zivný, Peter Jeavons 0001 Classes of Submodular Constraints Expressible by Graph Cuts. Search on Bibsonomy CP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
92Fabián A. Chudak, Kiyohito Nagano Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
92Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Search on Bibsonomy Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000): 90C27, 90C25, 90C35, 90B10
79Satoru Iwata 0001, James B. Orlin A simple combinatorial algorithm for submodular function minimization. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
74Satoru Iwata 0001, Satoko Moriguchi, Kazuo Murota A capacity scaling algorithm for M-convex submodular flow. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Discrete convex function, Submodular flow, Algorithm, Discrete optimization
66Ariel Kulik, Hadas Shachnai, Tami Tamir Maximizing submodular set functions subject to multiple linear constraints. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
66Jon Lee 0001, Maxim Sviridenko, Jan Vondrák Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
66Tamás Király, Lap Chi Lau, Mohit Singh Degree Bounded Matroids and Submodular Flows. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
66Dmitrij Schlesinger Exact Solution of Permuted Submodular MinSum Problems. Search on Bibsonomy EMMCVPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
66Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation. Search on Bibsonomy AAMAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF strategy-proof, combinatorial auction
53Elchanan Mossel, Sébastien Roch On the submodularity of influence in social networks. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF social networks, coupling, viral marketing, submodularity
53Sang-il Oum, Paul D. Seymour Certifying large branch-width. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Petr Skoda 0001 Computability of Width of Submodular Partition Functions. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
52Martin C. Cooper Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Valued constraint satisfaction problem, Majority operation, Optimal soft arc consistency, Linear programming, Soft constraints, Discrete optimization, Submodularity
52Shahar Dobzinski, Michael Schapira An improved approximation algorithm for combinatorial auctions with submodular bidders. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Satoru Iwata 0001, Satoko Moriguchi, Kazuo Murota A Capacity Scaling Algorithm for M-convex Submodular Flow. Search on Bibsonomy IPCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
52Toshihiro Fujito, Takatoshi Yabuta Submodular Integer Cover and Its Application to Production Planning. Search on Bibsonomy WAOA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
52Satoru Iwata 0001 A Faster Scaling Algorithm for Minimizing Submodular Functions. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
52Kazuo Murota Submodular Flow Problem with a Nonseparable Cost Function. Search on Bibsonomy Comb. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 90C35, 90C27, 90C10
52Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
48Kiyohito Nagano On Convex Minimization over Base Polytopes. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF convex optimization, submodular functions
48Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki Greedy splitting algorithms for approximating multiway partition problems. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF k-way cut, Multiterminal cut, Multiway partition problem, Approximation algorithm, Submodular function, Hypergraph partition
47Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Combinatorial auctions, Hardness of approximation, Social welfare, Submodular
47Satoru Iwata 0001, Lisa Fleischer, Satoru Fujishige A combinatorial strongly polynomial algorithm for minimizing submodular functions. Search on Bibsonomy J. ACM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Discrete optimization, submodular function, strongly polynomial algorithm
40Adrian Vetta Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
39Satoru Iwata 0001 Submodular function minimization. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C27
39Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Toshinari Itoko, Satoru Iwata 0001 Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
39Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson Approximation algorithms for prize collecting forest problems with submodular penalty functions. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
39Kazuo Murota, Akihisa Tamura Application of M-Convex Submodular Flow Problem to Mathematical Economics. Search on Bibsonomy ISAAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
37Majun Shi, Zishen Yang, Wei Wang 0032 Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
37Rishabh K. Iyer, Jeff A. Bilmes Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
37Rishabh K. Iyer, Jeff A. Bilmes Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints. Search on Bibsonomy NIPS The full citation details ... 2013 DBLP  BibTeX  RDF
35Tim Roughgarden, Mukund Sundararajan Quantifying inefficiency in cost-sharing mechanisms. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF inefficiency, Mechanism design, Steiner tree, cost sharing, submodular functions
35Stefano Benati An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF competitive location models, random utility theory, heuristic concentration, data-correcting method, submodular functions
35Ulrich Faigle, Walter Kern An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games. Search on Bibsonomy Order The full citation details ... 2000 DBLP  DOI  BibTeX  RDF antimatroid, coöperative game, Monge algorithm, Weber set, greedy algorithm, core, poset, matroid, submodular
34Jan Vondrák Symmetry and Approximability of Submodular Maximization Problems. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF submodular functions. matroids, multilinear extension, approximation algorithms
34Satoru Iwata 0001, Kiyohito Nagano Submodular Function Minimization under Covering Constraints. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithm, set cover, vertex cover, submodular function
34Harold N. Gabow A Framework for Cost-scaling Algorithms for Submodular Flow Problems Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF cost-scaling algorithms, submodular flow problems, dijoin, edge-connectivity orientation, k-edge-connected orientation, minimum-cost k-edge-connected orientation, integer linear programming, vertices, vertex weights, minimum-cost network flow
27S. Thomas McCormick, Satoru Fujishige Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Search on Bibsonomy Math. Program. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) Primary: 65K05, Secondary: 90C27, 68W40
27Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan Revenue Submodularity. Search on Bibsonomy AMMA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan Revenue submodularity. Search on Bibsonomy EC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF market expansion, efficiency, monotonicity, trade-offs, revenue, submodularity, vcg, optimal auctions
27Stanislav Zivný, Peter G. Jeavons The Complexity of Valued Constraint Models. Search on Bibsonomy CP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27S. Thomas McCormick, Satoru Fujishige Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
27Vahab S. Mirrokni, Michael Schapira, Jan Vondrák Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. Search on Bibsonomy EC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms, combinatorial auctions
27Srikumar Ramalingam, Pushmeet Kohli, Karteek Alahari, Philip H. S. Torr Exact inference in multi-label CRFs with higher order cliques. Search on Bibsonomy CVPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Fang Bian, David Kempe 0001, Ramesh Govindan Utility based sensor selection. Search on Bibsonomy IPSN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF sub-modular, super-modular, sensor networks, complexity, utility, sensor selection
27Uriel Feige, Jan Vondrák Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige Minimum Transversals in Posi-modular Systems. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Sachin B. Patkar, H. Narayanan An Efficient Practical Heuristic For Good Ratio-Cut Partitioning. Search on Bibsonomy VLSI Design The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
27David D. Yao S-modular games, with queueing applications. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF submodularity/supermodularity, control of queues, convergence, Nash equilibrium, Noncooperative games
26Erik D. Demaine, Morteza Zadimoghaddam Scheduling to minimize power consumption using submodular functions. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF pre-emptive scheduling, sleep state, approximation algorithms, multiprocessor scheduling
26James B. Orlin A faster strongly polynomial time algorithm for submodular function minimization. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Paul Vernaza, Ben Taskar, Daniel D. Lee Online, self-supervised terrain classification via discriminatively trained submodular Markov random fields. Search on Bibsonomy ICRA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Deeparnab Chakrabarty, Gagan Goel On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Jérôme Darbon Global Optimization for First Order Markov Random Fields with Submodular Priors. Search on Bibsonomy IWCIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Arash Asadpour, Hamid Nazerzadeh, Amin Saberi Stochastic Submodular Maximization. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Tomás Kroupa Geometry of Cores of Submodular Coherent Upper Probabilities and Possibility Measures. Search on Bibsonomy SMPS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Coherent upper probability, Core, Possibility measure
26James B. Orlin A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Search on Bibsonomy WINE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Satoru Iwata 0001 A fully combinatorial algorithm for submodular function minimization. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
26Fedor V. Fomin, Dimitrios M. Thilikos On the Monotonicity of Games Generated by Symmetric Submodular Functions. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Hiroshi Nagamochi, Toshihide Ibaraki Polyhedral Structure of Submodular and Posi-modular Systems. Search on Bibsonomy ISAAC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
26David Hartvigsen A Submodular Optimization Problem with Side Constraints. Search on Bibsonomy IPCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
24Cheng Lu, Wenguo Yang, Suixiang Gao Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions. Search on Bibsonomy Optim. Lett. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Niv Buchbinder, Moran Feldman Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Zongqi Wan, Jialin Zhang, Wei Chen, Xiaoming Sun 0001, Zhijie Zhang Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Cyrus Cousins, Vignesh Viswanathan, Yair Zick The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Madhavan R. Padmanabhan, Yanhui Zhu, Samik Basu 0001, Aduri Pavan Maximizing submodular functions under submodular constraints. Search on Bibsonomy UAI The full citation details ... 2023 DBLP  BibTeX  RDF
24Cyrus Cousins, Vignesh Viswanathan, Yair Zick The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences. Search on Bibsonomy WINE The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
24Zongqi Wan, Jialin Zhang, Wei Chen, Xiaoming Sun 0001, Zhijie Zhang Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits. Search on Bibsonomy ICML The full citation details ... 2023 DBLP  BibTeX  RDF
24Xiaofei Liu, Weidong Li 0002 Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
24Xin Wang, Suogang Gao, Bo Hou, Lidong Wu, Wen Liu 0009 Approximation algorithms for the submodular edge cover problem with submodular penalties. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
24Pierre Perrault, Jennifer Healey, Zheng Wen, Michal Valko On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
24Naoto Ohsaka, Tatsuya Matsuoka Approximation algorithm for submodular maximization under submodular cover. Search on Bibsonomy UAI The full citation details ... 2021 DBLP  BibTeX  RDF
24Tatsuya Matsuoka, Naoto Ohsaka Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions. Search on Bibsonomy ACML The full citation details ... 2021 DBLP  BibTeX  RDF
24Rad Niazadeh, Tim Roughgarden, Joshua R. Wang Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. Search on Bibsonomy J. Mach. Learn. Res. The full citation details ... 2020 DBLP  BibTeX  RDF
24Akbar Rafiey, Yuichi Yoshida Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
24Lintao Ye, Shreyas Sundaram Distributed Maximization of Submodular and Approximately Submodular Functions. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
24Lintao Ye, Shreyas Sundaram Distributed Maximization of Submodular and Approximately Submodular Functions. Search on Bibsonomy CDC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
24Akbar Rafiey, Yuichi Yoshida Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. Search on Bibsonomy ICML The full citation details ... 2020 DBLP  BibTeX  RDF
24Chao Qian 0001, Yang Yu 0001, Ke Tang 0001, Xin Yao 0001, Zhi-Hua Zhou Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. Search on Bibsonomy Artif. Intell. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
24Victoria G. Crawford, Alan Kuhnle, My T. Thai Submodular Cost Submodular Cover with an Approximate Oracle. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
24Victoria G. Crawford, Alan Kuhnle, My T. Thai Submodular Cost Submodular Cover with an Approximate Oracle. Search on Bibsonomy ICML The full citation details ... 2019 DBLP  BibTeX  RDF
24Rad Niazadeh, Tim Roughgarden, Joshua R. Wang Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
24Wenruo Bai, William Stafford Noble, Jeff A. Bilmes Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions. Search on Bibsonomy NeurIPS The full citation details ... 2018 DBLP  BibTeX  RDF
24Rad Niazadeh, Tim Roughgarden, Joshua R. Wang Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. Search on Bibsonomy NeurIPS The full citation details ... 2018 DBLP  BibTeX  RDF
24Naoyuki Kamiyama A note on the submodular vertex cover problem with submodular penalties. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
24Naoyuki Kamiyama Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. Search on Bibsonomy WAOA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
24Dachuan Xu, Fengmin Wang, Donglei Du, Chenchen Wu Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
24Sin-Shuen Cheung The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem. Search on Bibsonomy WAOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
24Dachuan Xu, Fengmin Wang, Donglei Du, Chenchen Wu Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties. Search on Bibsonomy COCOON The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2162 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license