Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900918
DOI10.1007/b11961zbMath1279.68352OpenAlexW4298253479MaRDI QIDQ5900918
Stefan Hougardy, Doratha E. Drake
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
Approximating weighted matchings in parallel, Linear-Time Approximation for Maximum Weight Matching, A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching, A \(2/3\)-approximation algorithm for vertex-weighted matching, Efficient Matching for Column Intersection Graphs