scientific article; zbMATH DE number 2077129

zbMATH Open1044.90522MaRDI QIDQ4470513FDOQ4470513

Authors: Prabhakar Raghavan 

Publication date: 1 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 780783
• Publication:4938889
• A case study of de-randomization methods for combinatorial approximation algorithms
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Randomization, approximation, and combinatorial optimization. Algorithms and techniques. 3rd international workshop on Randomization and approximation techniques in computer science, and 2nd international workshop on Approximation algorithms for combinato

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (18)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Randomized approximation of bounded multicovering problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments
• Combinatorial Optimization Over Two Random Point Sets
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Randomized Algorithms for Local Sorting and Set-Maxima
• Randomized optimization: a probabilistic analysis
• Randomized Post-optimization for t-Restrictions
• Randomized approximation and online algorithms for assignment problems
• Title not available (Why is that?)
• Randomized Speedup of the Bellman–Ford Algorithm
• Randomized metarounding

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470513)