scientific article; zbMATH DE number 910872
From MaRDI portal
Publication:4886046
Recommendations
Cited in
(35)- Packing trees in communication networks
- Hitting sets when the VC-dimension is small
- Scheduling multicasts on unit-capacity trees and meshes.
- Approximating covering integer programs with multiplicity constraints
- Fast approximation of matroid packing and covering
- Exponential penalty function control of loss networks
- Adaptive game playing using multiplicative weights
- On the approximability of robust network design
- Mobile facility location: combinatorial filtering via weighted occupancy
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- An approximation algorithm for the general max-min resource sharing problem
- Approximation algorithms for covering/packing integer programs
- Randomized rounding in the presence of a cardinality constraint
- An approximation algorithm for path computation and function placement in SDNs
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Efficient primal-dual graph algorithms for MapReduce
- Linear programming in the semi-streaming model with application to the maximum matching problem
- A derandomized approximation algorithm for the critical node detection problem
- Computing weighted strength and applications to partitioning
- Oblivious rounding and the integrality gap
- Fractional set cover in the streaming model
- Multicommodity network flows: A survey. II: Solution methods
- Fairness in Influence Maximization through Randomization
- On a generalization of iterated and randomized rounding
- Randomized Rounding in the Presence of a Cardinality Constraint
- Faster min-max resource sharing in theory and practice
- Distributed dense subgraph detection and low outdegree orientation
- Minimum cut in \(O(m \log^2 n)\) time
- A generalized approximation framework for fractional network flow and packing problems
- Minimum cut in O(m^2 n time
- High-accuracy multicommodity flows via iterative refinement
- A nearly optimal deterministic online algorithm for non-metric facility location
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886046)
