Pages that link to "Item:Q1112724"
From MaRDI portal
The following pages link to Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724):
Displaying 50 items.
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Staying safe and visible via message sharing in online social networks (Q405681) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- A closest vector problem arising in radiation therapy planning (Q411241) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Improved algorithms for latency minimization in wireless networks (Q541672) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← 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)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Probabilistic optimal solution assessment for DCOPs (Q722106) (← links)
- Algorithms for solving minimax scheduling problem (Q734231) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- Matrix approximation and Tusnády's problem (Q872057) (← links)
- A guided tour of Chernoff bounds (Q915256) (← links)
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- Analysis of an asynchronous PRAM algorithm (Q1183402) (← links)
- Integer programming in VLSI design (Q1201818) (← links)
- Approximation algorithms for geometric median problems (Q1209349) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← 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)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- The maximum clique problem (Q1318271) (← links)
- Randomization, derandomization and antirandomization: Three games (Q1331937) (← links)
- Listing graphs that satisfy first-order sentences (Q1337473) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- On the approximation of the minimum disturbance \(p\)-facility location problem (Q1348254) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Minimizing the maximum flow time in batch scheduling (Q1709967) (← links)
- Approximability of the robust representatives selection problem (Q1785311) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
