5.2k citations
- Courant Institute of Mathematical SciencesUS5 papers
- University of Illinois Urbana-ChampaignUS4 papers
- University of WashingtonUS4 papers
- Columbia UniversityUS3 papers
- Cornell UniversityUS3 papers
- Massachusetts Institute of TechnologyUS3 papers
- Microsoft (United States)US3 papers
- New York UniversityUS3 papers
- Bharathidasan UniversityIN2 papers
- Laboratory for Atmospheric and Space PhysicsUS2 papers
- Microsoft Research (India)IN2 papers
- Rensselaer Polytechnic InstituteUS2 papers
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010★ 3 cited
Approximability of Capacitated Network Design
Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna +1
In the {\em capacitated} survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minim…
cs.DS2010★ 39 cited
Online Stochastic Packing Applied to Display Ad Allocation
Jon Feldman, Monika Henzinger, Nitish Korula +2
Inspired by online ad allocation, we study online stochastic packing linear programs from theoretical and practical standpoints. We first present a near-optimal online algorithm fo…