On dependent randomized rounding algorithms
type: Item
instance of: scholarly article
title: On dependent randomized rounding algorithms
zbMATH Open document ID: 0954.90025
DOI: 10.1016/S0167-6377(99)00010-3
published in: Operations Research Letters
publication date: 2001-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1347266
zbMATH Keywords: approximation algorithms
zbMATH Keywords: randomized rounding
zbMATH Keywords: round fractional solution to 0-1 solution
author: Dimitris Bertsimas
author: Chung-Piaw Teo
author: Rakesh V. Vohra
MaRDI profile type: Publication
cites work: Rounding algorithms for covering problems
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Q3292914
cites work: Q4234151
cites work: .878-approximation algorithms for MAX CUT and MAX 2SAT
cites work: Unimodular functions
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Q4400848
cites work: The Minimum Satisfiability Problem
cites work: The geometry of graphs and some of its algorithmic applications
cites work: Q4040221
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: An approximation algorithm for the generalized assignment problem
description: scientific article; zbMATH DE number 1347266