The Balanced Edge Cover Problem

DOI10.1007/978-3-540-92182-0_24MaRDI QIDQ3596723zbMATH OpenOpenAlexFDO

Authors Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_24

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Broadcast covers in graphs
• Minimum cost edge subset covering exactly \(k\) vertices of a graph
• Approximation algorithms for the submodular edge cover problem with submodular penalties
• Algorithms - ESA 2003
• The minimum generalized vertex cover problem

Cited in

(1)

• Faster algorithms for semi-matching problems

This page was built for publication: The Balanced Edge Cover Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596723)