Výsledky vyhľadávania - "Theory of computation → Approximation algorithms analysis phrases Maximum weight matching"

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

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

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

Zdroj: Algorithmica. 86:3598-3628

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a ďalší

Prispievatelia: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) a ďalší

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

Predmety: 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]

Geografické téma: Seattle, United States

Dostupnosť: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf