Rounding algorithms for covering problems
type: Item
instance of: scholarly article
title: Rounding algorithms for covering problems
zbMATH Open document ID: 0894.90121
DOI: 10.1007/BF01582131
published in: Mathematical Programming. Series A. Series B
publication date: 1998-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1127725
zbMATH Keywords: approximation
zbMATH Keywords: heuristics
zbMATH Keywords: rounding
author: Dimitris Bertsimas
author: Rakesh V. Vohra
MaRDI profile type: Publication
Wikidata QID: Q100884359
cites work: Q4198056
cites work: Q4230322
cites work: On the hardness of approximating minimization problems
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Q4763416
cites work: A primal-dual approximation algorithm for generalized Steiner network problems
cites work: Q3128880
cites work: Q4277623
cites work: Approximation algorithms for combinatorial problems
cites work: Q4234151
cites work: On the ratio of optimal integral and fractional covers
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Q4004078
cites work: A fast approximation algorithm for the multicovering problem
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: On the Greedy Heuristic for Continuous Covering and Packing Problems
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Heuristics for the fixed cost median problem
cites work: Q3950588
cites work: Q4234132
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
cites work: Optimization, approximation, and complexity classes
DBLP publication ID: journals/mp/BertsimasV98
description: scientific article; zbMATH DE number 1127725