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):
Displaying 50 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
- A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Improved algorithms for latency minimization in wireless networks (Q541672) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- Randomized oblivious integral routing for minimizing power cost (Q897952) (← 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)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← 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)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- Cost-efficient scheduling on machines from the cloud (Q1631672) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← 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)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
