Rounding to an integral program

DOI10.1016/j.orl.2007.11.002zbMath1152.90534OpenAlexW2085327320MaRDI QIDQ943791

Danny Segev, Refael Hassin

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

zbMATH Keywords

LP-roundinginteger covering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (2)

Partial multicovering and the \(d\)-consecutive ones property ⋮ Improved approximations for guarding 1.5-dimensional terrains

Cites Work

• Unnamed Item
• On the hardness of approximating minimum vertex cover
• On the multi-radius cover problem
• Approximation algorithms for combinatorial problems
• On dependent randomized rounding algorithms
• Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
• A threshold of ln n for approximating set cover
• Optimal Capacity Scheduling—I
• A linear-time approximation algorithm for the weighted vertex cover problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Set Partitioning: A survey
• Algorithms and Data Structures
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Approximation algorithms for feasible cut and multicut problems

This page was built for publication: Rounding to an integral program