Suchergebnisse - "continuous greedy algorithm"

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice: — Continuous Greedy Algorithm on Median Complex —

Autoren: Takanori Maehara So Nakashima Yutaro Yamaguchi

Quelle: Mathematical Programming. 194:85-119

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/1907.04279
https://arxiv.org/abs/1907.04279
http://arxiv-export-lb.library.cornell.edu/abs/1907.04279
https://www.scilit.net/article/f4ff215cbc87e52ccb92b8536eb40eae
https://kyushu-u.pure.elsevier.com/en/publications/multiple-knapsack-constrained-monotone-dr-submodular-maximization
https://link.springer.com/article/10.1007/s10107-021-01620-7
https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-04279

A unified continuous greedy algorithm for $k$-submodular maximization under a down-monotone constraint

Autoren: Zhang, Hongyang Luo, Wenchang

Schlagwörter: FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)

Zugangs-URL: http://arxiv.org/abs/2311.18239

Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex

Autoren: Maehara, Takanori Nakashima, So Yamaguchi, Yutaro

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1907.04279

An accelerated continuous greedy algorithm for maximizing strong submodular functions

Autoren: Xuezhi Wang Zengfu Wang Quan Pan et al.

Quelle: Journal of Combinatorial Optimization. 30:1107-1124

Schlagwörter: 1. No poverty, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

A Unified Continuous Greedy Algorithm for Submodular Maximization

Autoren: Joseph (Seffi) Naor Roy Schwartz Moran Feldman

Quelle: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. :570-579

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm

Autoren: Joseph (Seffi) Naor Moran Feldman Roy Schwartz

Quelle: Lecture Notes in Computer Science ISBN: 9783642220050

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-642-22006-7_29
https://link.springer.com/chapter/10.1007%2F978-3-642-22006-7_29
https://www.openu.ac.il/personal_sites/moran-feldman/publications/ICALP2011Full.pdf
http://www.cs.technion.ac.il/~moranfe/Publications/ICALP2011.pdf

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice: — Continuous Greedy Algorithm on Median Complex —.

Autoren: Maehara, Takanori Nakashima, So Yamaguchi, Yutaro

Quelle: Mathematical Programming; Jul2022, Vol. 194 Issue 1/2, p85-119, 35p

Schlagwörter: GREEDY algorithms, CONCAVE functions, BACKPACKS, DISTRIBUTIVE lattices, MATHEMATICAL programming, APPROXIMATION algorithms, ALGORITHMS

Nonmonotone submodular maximization via a structural continuous greedy algorithm (Extended Abstract)

Autoren: Moran Feldman Joseph (Seffi) Naor Roy Schwartz et al.

Weitere Verfasser: Moran Feldman Joseph (Seffi) Naor Roy Schwartz et al.

Quelle: http://www.cs.technion.ac.il/%7Eschwartz/Publications/FNS-ICALP11.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.2835

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.2835
http://www.cs.technion.ac.il/%7Eschwartz/Publications/FNS-ICALP11.pdf

An accelerated continuous greedy algorithm for maximizing strong submodular functions

Autoren: Zengfu Wang William Moran Xuezhi Wang et al.

Schlagwörter: Applied mathematics not elsewhere classified, Numerical and computational mathematics not elsewhere classified, Pure mathematics not elsewhere classified, Approximation algorithm, Matroid, Monotone submodular set function

Relation: 10779/rmit.27480498.v1; https://figshare.com/articles/journal_contribution/An_accelerated_continuous_greedy_algorithm_for_maximizing_strong_submodular_functions/27480498

Verfügbarkeit: https://figshare.com/articles/journal_contribution/An_accelerated_continuous_greedy_algorithm_for_maximizing_strong_submodular_functions/27480498

An accelerated continuous greedy algorithm for maximizing strong submodular functions.

Autoren: Wang, Zengfu Moran, Bill Wang, Xuezhi et al.

Quelle: Journal of Combinatorial Optimization; Nov2015, Vol. 30 Issue 4, p1107-1124, 18p

Nonmonotone submodular maximization via a structural continuous greedy algorithm

Autoren: Moran Feldman Joseph (seffi Naor Roy Schwartz et al.

Weitere Verfasser: Moran Feldman Joseph (seffi Naor Roy Schwartz et al.

Quelle: http://research.microsoft.com/en-us/um/people/roysch/Papers/USMSA-FNS11.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.8672

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.8672
http://research.microsoft.com/en-us/um/people/roysch/Papers/USMSA-FNS11.pdf

A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice.

Autoren: Hu, Jiaming Hao, Chunlin Miao, Cuixia et al.

Quelle: International Journal of Foundations of Computer Science; Aug2025, Vol. 36 Issue 5, p649-666, 18p

Schlagwörter: PRIVACY, SUBMODULAR functions, LATTICE theory, ALGORITHMS, GREEDY algorithms, MATHEMATICAL optimization

A Unified Continuous Greedy Algorithm for Submodular Maximization.

Autoren: Feldman, M. Naor, J. Schwartz, R.

Quelle: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS); 2011, p570-579, 10p

Regularized nonmonotone submodular maximization.

Autoren: Lu, Cheng Yang, Wenguo Gao, Suixiang

Quelle: Optimization. Jun2024, Vol. 73 Issue 6, p1739-1765. 27p.

Schlagwörter: *SUBMODULAR functions, *MODULAR functions, *MATROIDS, *PROBLEM solving, *GREEDY algorithms, *SAMPLING (Process), *DESIGN techniques

The matroid team surviving orienteers problem and its variants: Constrained routing of heterogeneous teams with risky traversal.

Autoren: Jorgensen, Stefan Pavone, Marco

Quelle: International Journal of Robotics Research; Jan2024, Vol. 43 Issue 1, p34-52, 19p

Schlagwörter: POLYNOMIAL time algorithms, MATROIDS, ROBOTIC path planning, ORIENTEERING, ORIENTEERS, GREEDY algorithms, ROUTING algorithms

Beyond submodular maximization via one-sided smoothness.

Autoren: Ghadiri, Mehrdad Santiago, Richard Shepherd, Bruce

Quelle: Mathematical Programming. Nov2025, p1-37.

Schlagwörter: *MATHEMATICAL optimization, *DYNAMIC programming, SMOOTHNESS of functions, SUBMODULAR functions, DISCRETIZATION methods, CONSTRAINED optimization, GREEDY algorithms

Parametric monotone function maximization with matroid constraints.

Autoren: Gong, Suning Nong, Qingqin Liu, Wenjing et al.

Quelle: Journal of Global Optimization; Nov2019, Vol. 75 Issue 3, p833-849, 17p

Schlagwörter: MATROIDS, GREEDY algorithms, SET functions, APPROXIMATION algorithms, MAXIMAL functions, MODULAR forms

Fast algorithms for maximizing monotone nonsubmodular functions.

Autoren: Liu, Bin Hu, Miaomiao

Quelle: Journal of Combinatorial Optimization; Jul2022, Vol. 43 Issue 5, p1655-1670, 16p

Decomposable Submodular Maximization in Federated Setting

Autoren: Rafiey, Akbar

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Artificial Intelligence, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/2402.00138

Maximizing a deep submodular function optimization with a weighted MAX-SAT problem for trajectory clustering and motion segmentation.

Autoren: Chandriah, Kiran Kumar Naraganahalli, Raghavendra V

Quelle: Applied Intelligence; Nov2021, Vol. 51 Issue 11, p8192-8211, 20p

Schlagwörter: SUBMODULAR functions, COMPUTER vision, COMPUTER simulation