Publication:4886046
From MaRDI portal
zbMath0849.90100MaRDI QIDQ4886046
Publication date: 22 August 1996
Related Items
Computing Weighted Strength and Applications to Partitioning, Unnamed Item, Fairness in Influence Maximization through Randomization, Fractional Set Cover in the Streaming Model., A derandomized approximation algorithm for the critical node detection problem, Faster min-max resource sharing in theory and practice, A generalized approximation framework for fractional network flow and packing problems, 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, 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, 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
