scientific article; zbMATH DE number 910872

From MaRDI portal
Publication:4886046

zbMath0849.90100MaRDI QIDQ4886046

Neal E. Young

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 problemComputing Weighted Strength and Applications to PartitioningFairness in Influence Maximization through RandomizationOn the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation AlgorithmsFaster and simpler approximation algorithms for mixed packing and covering problemsEfficient Primal-Dual Graph Algorithms for MapReduceScheduling multicasts on unit-capacity trees and meshes.Approximating covering integer programs with multiplicity constraintsUnnamed ItemApproximation algorithms for general packing problems and their application to the multicast congestion problemFast approximation of matroid packing and coveringFractional Set Cover in the Streaming Model.Linear Programming in the Semi-streaming Model with Application to the Maximum Matching ProblemA generalized approximation framework for fractional network flow and packing problemsMobile facility location: combinatorial filtering via weighted occupancyOn the approximability of robust network designFaster min-max resource sharing in theory and practiceExponential penalty function control of loss networksAn approximation algorithm for the general max-min resource sharing problemPacking trees in communication networksAdaptive game playing using multiplicative weightsAn Approximation Algorithm for Path Computation and Function Placement in SDNsHitting sets when the VC-dimension is smallApproximation algorithms for covering/packing integer programsI/O efficient algorithms for the minimum cut problem on unweighted undirected graphsAn \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries




This page was built for publication: