scientific article; zbMATH DE number 910872
From MaRDI portal
Publication:4886046
zbMath0849.90100MaRDI QIDQ4886046
Publication date: 22 August 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
A derandomized approximation algorithm for the critical node detection problem ⋮ Computing Weighted Strength and Applications to Partitioning ⋮ Fairness in Influence Maximization through Randomization ⋮ On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms ⋮ Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ Efficient Primal-Dual Graph Algorithms for MapReduce ⋮ Scheduling multicasts on unit-capacity trees and meshes. ⋮ Approximating covering integer programs with multiplicity constraints ⋮ Unnamed Item ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Fast approximation of matroid packing and covering ⋮ Fractional Set Cover in the Streaming Model. ⋮ Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ Mobile facility location: combinatorial filtering via weighted occupancy ⋮ On the approximability of robust network design ⋮ Faster min-max resource sharing in theory and practice ⋮ Exponential penalty function control of loss networks ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ Packing trees in communication networks ⋮ Adaptive game playing using multiplicative weights ⋮ An Approximation Algorithm for Path Computation and Function Placement in SDNs ⋮ Hitting sets when the VC-dimension is small ⋮ Approximation algorithms for covering/packing integer programs ⋮ 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
This page was built for publication: