Rounding to an integral program
type: Item
instance of: scholarly article
title: Rounding to an integral program
zbMATH Open document ID: 1152.90534
author: Refael Hassin
author: Danny Segev
published in: Operations Research Letters
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5324082
zbMATH Keywords: LP-rounding
zbMATH Keywords: integer covering
MaRDI profile type: Publication
full work available at URL: j.orl.2007.11.002
OpenAlex ID: W2085327320
cites work: Set Partitioning: A survey
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: On dependent randomized rounding algorithms
cites work: On the hardness of approximating minimum vertex cover
cites work: A threshold of ln n for approximating set cover
cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints
cites work: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
cites work: Algorithms and Data Structures
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Q4400848
cites work: Approximation algorithms for combinatorial problems
cites work: On the multi-radius cover problem
cites work: Optimal Capacity Scheduling—I
cites work: Approximation algorithms for feasible cut and multicut problems
DOI: 10.1016/J.ORL.2007.11.002
description: scientific article; zbMATH DE number 5324082