Primal-dual meets local search
From MaRDI portal
Publication:3581300
DOI10.1145/780542.780600zbMath1192.90232MaRDI QIDQ3581300
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780600
90C35: Programming involving graphs or networks
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Approximation algorithms for finding low-degree subgraphs, A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids, What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs