Rounding to an integral program
From MaRDI portal
Publication:943791
DOI10.1016/J.ORL.2007.11.002zbMATH Open1152.90534OpenAlexW2085327320MaRDI QIDQ943791FDOQ943791
Authors: Refael Hassin, Danny Segev
Publication date: 10 September 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.11.002
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Cites Work
- A threshold of ln n for approximating set cover
- Approximation algorithms for combinatorial problems
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- On the hardness of approximating minimum vertex cover
- A linear-time approximation algorithm for the weighted vertex cover problem
- Set Partitioning: A survey
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- Approximation algorithms for feasible cut and multicut problems
- Optimal Capacity Scheduling—I
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- On dependent randomized rounding algorithms
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Title not available (Why is that?)
- Algorithms and Data Structures
- On the multi-radius cover problem
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)