Approximating the minimum weight weak vertex cover

DOI10.1016/j.tcs.2006.06.009zbMath1110.68008OpenAlexW1998327858MaRDI QIDQ860818

Yong Zhang, Rudolf Fleischer, Hong Zhu, Qi Ge, Tao Jiang

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.009

zbMATH Keywords

cycle-rank-proportional graphlocal-ratio theoremnetwork flow measurement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• The importance of being biased
• Domination in Graphs Applied to Electric Power Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the minimum weight weak vertex cover