scientific article
From MaRDI portal
Publication:3191563
DOI10.4086/toc.2012.v008a024zbMath1297.68259OpenAlexW782508147MaRDI QIDQ3191563
Nikhil Bansal, Nitish Korula, Aravind Srinivasan, Viswanath Nagarajan
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Streaming Algorithms for Submodular Function Maximization ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ Partial Resampling to Approximate Covering Integer Programs ⋮ Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints ⋮ Scheduling split intervals with non-uniform demands ⋮ Network pollution games ⋮ Approximating Sparse Covering Integer Programs Online ⋮ \(\ell_1\)-sparsity approximation bounds for packing integer programs ⋮ New Results for Network Pollution Games ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
Cites Work
This page was built for publication:
