New and Improved Bounds for the Minimum Set Cover Problem

DOI10.1007/978-3-642-32512-0_25zbMath1372.68306OpenAlexW2106984527MaRDI QIDQ3167404

M. I. Sviridenko, Rishi Saket

Publication date: 2 November 2012

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_25

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

A fast network-decomposition algorithm and its applications to constant-time distributed computation ⋮ A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation ⋮ Robust combinatorial optimization with locally budgeted uncertainty ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ A randomised approximation algorithm for the hitting set problem

This page was built for publication: New and Improved Bounds for the Minimum Set Cover Problem