Suchergebnisse - "Theory of computation → Approximation algorithms analysis phrases Maximum weight matching"

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoren: Chien-Chung Huang François Sellier Huang, Chien-Chung

Weitere Verfasser: Chien-Chung Huang François Sellier Huang, Chien-Chung

Quelle: Algorithmica. 86:3598-3628

Schlagwörter: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoren: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Weitere Verfasser: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Quelle: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States

Schlagwörter: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]

Geographisches Schlagwort: Seattle, United States

Verfügbarkeit: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf