Approximation algorithms for general packing problems and their application to the multicast congestion problem
From MaRDI portal
(Redirected from Publication:925266)
Recommendations
Cites work
- scientific article; zbMATH DE number 2089220 (Why is no real title available?)
- scientific article; zbMATH DE number 42384 (Why is no real title available?)
- scientific article; zbMATH DE number 1215271 (Why is no real title available?)
- scientific article; zbMATH DE number 1086924 (Why is no real title available?)
- scientific article; zbMATH DE number 2011854 (Why is no real title available?)
- scientific article; zbMATH DE number 1522943 (Why is no real title available?)
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- Algorithms and Computation
- Algorithms – ESA 2004
- An approximation algorithm for the general max-min resource sharing problem
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Approximate max-min resource sharing for structured concave optimization
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
- Approximation algorithms for scheduling unrelated parallel machines
- Assign ranges in general ad-hoc networks
- Coordination Complexity of Parallel Price-Directive Decomposition
- Experimental and Efficient Algorithms
- Fast Approximate Graph Partitioning Algorithms
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Fast deterministic approximation for the multicommodity flow problem
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Geometric algorithms and combinatorial optimization
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Proof verification and the hardness of approximation problems
- Randomized metarounding (extended abstract)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Structural Information and Communication Complexity
- The Steiner problem with edge lengths 1 and 2
Cited in
(11)- scientific article; zbMATH DE number 2011854 (Why is no real title available?)
- Faster min-max resource sharing in theory and practice
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
- scientific article; zbMATH DE number 2163027 (Why is no real title available?)
- scientific article; zbMATH DE number 1522943 (Why is no real title available?)
- Fair packing and covering on a relative scale
- Experimental and Efficient Algorithms
- Heuristic algorithms for packing of multiple-group multicasting
- On routing in VLSI design and communication networks
- Packing trees in communication networks
This page was built for publication: Approximation algorithms for general packing problems and their application to the multicast congestion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925266)
