Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

IPCO
1996

favoriteEmaildiscussreport

89views Optimization» more IPCO 1996»

On Dependent Randomized Rounding Algorithms

13 years 5 months ago

On Dependent Randomized Rounding Algorithms

Download web.mit.edu

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

Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra

Real-time Traffic

Discrete Optimization Problems | Fractional Optimal Solutions | IPCO 1996 | IPCO 2007 | Rounding |

claim paper

Related Content

» A Comparison of Three Rounding Algorithms for IEEE FloatingPoint Multiplication

» Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures

» Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV an...

» Dependent rounding and its applications to approximation algorithms

» On Calibration Error of Randomized Forecasting Algorithms

» Experimental Study of Nonoblivious Greedy and Randomized Rounding Algorithms for Hypergrap...

» MDVM System Concept Paging Latency and Round2 Randomized Leader Election Algorithm in SG

» Using Randomized Rounding to Satisfy Timing Constraints of RealTime Preemptive Tasks

» Scheduling Unrelated Machines by Randomized Rounding

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	IPCO
Authors	Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra

Comments (0)