On dependent randomized rounding algorithms
From MaRDI portal
Publication:1306458
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1263278 (Why is no real title available?)
- scientific article; zbMATH DE number 1182765 (Why is no real title available?)
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- A Greedy Heuristic for the Set-Covering Problem
- An approximation algorithm for the generalized assignment problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Bin packing can be solved within 1+epsilon in linear time
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Rounding algorithms for covering problems
- The Minimum Satisfiability Problem
- The geometry of graphs and some of its algorithmic applications
- Unimodular functions
Cited in
(33)- Dependent rounding and its applications to approximation algorithms
- Scheduling on unrelated machines under tree-like precedence constraints
- Dependent Randomized Rounding: The Bipartite Case
- A primal-dual approximation algorithm for \textsc{minsat}
- Geometric rounding: A dependent randomized rounding scheme
- Randomized Rounding in the Presence of a Cardinality Constraint
- Nonindependent Randomized Rounding and an Application to Digital Halftoning
- Approximation algorithms for supply chain planning and logistics problems with market choice
- scientific article; zbMATH DE number 2079377 (Why is no real title available?)
- Rounding to an integral program
- Dual parameterization and parameterized approximability of subset graph problems
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Heuristics for the dynamic facility location problem with modular capacities
- On the Minimum Hitting Set of Bundles Problem
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- scientific article; zbMATH DE number 1405893 (Why is no real title available?)
- Minimum hitting set of interval bundles problem: computational complexity and approximability
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- Revisiting maximum satisfiability and related problems in data streams
- On the minimum hitting set of bundles problem
- The entropy rounding method in approximation algorithms
- The enemy of my enemy is my friend: new conditions for network games
- Revisiting maximum satisfiability and related problems in data streams
- Randomized rounding in the presence of a cardinality constraint
- Randomized metarounding (extended abstract)
- Solving the maximum duo-preservation string mapping problem with linear programming
- Randomized metarounding
- On a generalization of iterated and randomized rounding
This page was built for publication: On dependent randomized rounding algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306458)
