Pages that link to "Item:Q1106724"
From MaRDI portal
The following pages link to Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724):
Displayed 42 items.
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- Approximation algorithms for geometric median problems (Q1209349) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games (Q3511400) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Approximation algorithms (Q4374975) (← links)
- Randomized metarounding (Q4537626) (← links)
- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers (Q5458533) (← links)
- Flows with Unit Path Capacities and Related Packing and Covering Problems (Q5505656) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- Optimal oblivious routing in polynomial time (Q5917575) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)