Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMath1095.68077OpenAlexW2615963353MaRDI QIDQ5315369

Janka Chlebíková, Miroslav Chlebík

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Approximating Edge Dominating Set in Dense Graphs ⋮ Crown reductions for the minimum weighted vertex cover problem ⋮ Continuous consensus with ambiguous failures ⋮ Approximating edge dominating set in dense graphs

This page was built for publication: Algorithm Theory - SWAT 2004