Pages that link to "Item:Q1306458"
From MaRDI portal
The following pages link to On dependent randomized rounding algorithms (Q1306458):
Displaying 25 items.
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- Rounding to an integral program (Q943791) (← links)
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- A case study of de-randomization methods for combinatorial approximation algorithms (Q1282206) (← links)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093) (← links)
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee (Q1888170) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments (Q2752028) (← links)
- Randomized rounding in the presence of a cardinality constraint (Q2828177) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
- On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
- Randomized metarounding (Q4537626) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q5233576) (← links)
- Dependent Randomized Rounding: The Bipartite Case (Q5233703) (← links)
- The enemy of my enemy is my friend: new conditions for network games (Q6088194) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
