Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900919
DOI10.1007/b11961zbMath1279.68353OpenAlexW4298253479MaRDI QIDQ5900919
R. Ravi, Naveen Garg, Guy Even, Jochen Könemann, Amitabh Sinha
Publication date: 26 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11961
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
Min-max cover of a graph with a small number of parts ⋮ Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
