On Dependent Randomized Rounding Algorithms

In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In this paper, we describe a class of rounding methods that exploits the structure and geometry of the underlying problem to round fractional solution to 0

• Type: Conference
• Year: 1996
• Where: IPCO
• Authors: Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
• Keywords: Discrete Optimization Problems, Fractional Optimal Solutions, IPCO 1996, IPCO 2007, Rounding