scientific article; zbMATH DE number 1405893

MaRDI QIDQ4938889zbMATH OpenFDO

Authors Aravind Srinivasan

Publication date 25 June 2000

zbMATH Keywords

approximation algorithmscombinatorial optimizationdiscrete optimizationNP-hardpolynomial time algorithmsquality of approximationrandomized roundingsurvey paper

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2077129
• Rounding algorithms for covering problems
• Randomized algorithms in combinatorial optimization: A survey
• On dependent randomized rounding algorithms
• scientific article; zbMATH DE number 780783

Cited in

(18)

• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• A case study of de-randomization methods for combinatorial approximation algorithms
• On dependent randomized rounding algorithms
• Rounding algorithms for covering problems
• Approximability of the robust representatives selection problem
• The smallest singular value of inhomogeneous square random matrices
• The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
• Analysis of randomized protocols for conflict-free distributed access
• Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments
• Randomized rounding in the presence of a cardinality constraint
• Randomized metarounding (extended abstract)
• scientific article; zbMATH DE number 1270543 (Why is no real title available?)
• scientific article; zbMATH DE number 2077129 (Why is no real title available?)
• Randomized metarounding
• scientific article; zbMATH DE number 7525474 (Why is no real title available?)
• Randomized Rounding in the Presence of a Cardinality Constraint
• Pricing commodities
• LP based heuristics for the multiple knapsack problem with assignment restrictions

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 Q4938889)