Covering the Edges of Bipartite Graphs Using K 2,2 Graphs

DOI10.1007/978-3-540-77918-6_10zbMath1130.90409OpenAlexW2173592967MaRDI QIDQ5443377

Asaf Levin, Dorit S. Hochbaum

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_10

zbMATH Keywords

network designapproximation algorithmsset cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (2)

Uniform unweighted set cover: the power of non-oblivious local search ⋮ Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings

This page was built for publication: Covering the Edges of Bipartite Graphs Using K 2,2 Graphs