Rounding to an integral program
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1182765 (Why is no real title available?)
- A linear-time approximation algorithm for the weighted vertex cover problem
- A threshold of ln n for approximating set cover
- Algorithms and Data Structures
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Approximation algorithms for combinatorial problems
- Approximation algorithms for feasible cut and multicut problems
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- On dependent randomized rounding algorithms
- On the hardness of approximating minimum vertex cover
- On the multi-radius cover problem
- Optimal Capacity Scheduling—I
- Set Partitioning: A survey
- The Set-Partitioning Problem: Set Covering with Equality Constraints
Cited in
(3)
This page was built for publication: Rounding to an integral program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943791)