scientific article; zbMATH DE number 2077129
From MaRDI portal
Publication:4470513
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
Cited in
(18)- scientific article; zbMATH DE number 1857640 (Why is no real title available?)
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima
- scientific article; zbMATH DE number 1405893 (Why is no real title available?)
- Randomized metarounding
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments
- scientific article; zbMATH DE number 1566488 (Why is no real title available?)
- Randomized Post-optimization for t-Restrictions
- scientific article; zbMATH DE number 3873085 (Why is no real title available?)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- scientific article; zbMATH DE number 1789921 (Why is no real title available?)
- scientific article; zbMATH DE number 780783 (Why is no real title available?)
- Randomized approximation and online algorithms for assignment problems
- Combinatorial Optimization Over Two Random Point Sets
- Randomized Speedup of the Bellman–Ford Algorithm
- Randomized optimization: a probabilistic analysis
- scientific article; zbMATH DE number 1163722 (Why is no real title available?)
- Randomized approximation of bounded multicovering problems
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)
