Approximation algorithms for network design: A survey

A Gupta, J Könemann - Surveys in Operations Research and Management …, 2011 - Elsevier
Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

Midrapidity Neutral-Pion Production in Proton-Proton Collisions at

SS Adler, S Afanasiev, C Aidala, NN Ajitanand… - Physical review …, 2003 - APS
The invariant differential cross section for inclusive neutral-pion production in p+ p collisions
at s= 200 G e V has been measured at midrapidity (| η|< 0.35) over the range 1< p T≲ 14 G e …

Adaptive seeding in social networks

L Seeman, Y Singer - 2013 IEEE 54th Annual Symposium on …, 2013 - ieeexplore.ieee.org
The algorithmic challenge of maximizing information diffusion through word-of-mouth
processes in social networks has been heavily studied in the past decade. While there has …

Designing network protocols for good equilibria

HL Chen, T Roughgarden, G Valiant - SIAM Journal on Computing, 2010 - SIAM
Designing and deploying a network protocol determines the rules by which end users
interact with each other and with the network. We consider the problem of designing a …

When LP is the cure for your matching woes: Improved bounds for stochastic matchings

N Bansal, A Gupta, J Li, J Mestre, V Nagarajan… - Algorithmica, 2012 - Springer
Consider a random graph model where each possible edge e is present independently with
some probability pe. Given these probabilities, we want to build a large/heavy matching in …

Sampling-based approximation algorithms for multistage stochastic optimization

C Swamy, DB Shmoys - SIAM Journal on Computing, 2012 - SIAM
Stochastic optimization problems provide a means to model uncertainty in the input data
where the uncertainty is modeled by a probability distribution over the possible realizations …

Approximation algorithms for reliable stochastic combinatorial optimization

E Nikolova - … on Randomization and Approximation Techniques in …, 2010 - Springer
We consider optimization problems that can be formulated as minimizing the cost of a
feasible solution w T x over an arbitrary combinatorial feasible set F⊂{0,1\}^n. For these …

Price of correlations in stochastic optimization

S Agrawal, Y Ding, A Saberi, Y Ye - Operations Research, 2012 - pubsonline.informs.org
When decisions are made in the presence of high-dimensional stochastic data, handling
joint distribution of correlated random variables can present a formidable task, both in terms …

CDB: optimizing queries with crowd-based selections and joins

G Li, C Chai, J Fan, X Weng, J Li, Y Zheng… - Proceedings of the …, 2017 - dl.acm.org
Crowdsourcing database systems have been proposed to leverage crowd-powered
operations to encapsulate the complexities of interacting with the crowd. Existing systems …

An approximation scheme for stochastic linear programming and its application to stochastic integer programs

DB Shmoys, C Swamy - Journal of the ACM (JACM), 2006 - dl.acm.org
Stochastic optimization problems attempt to model uncertainty in the data by assuming that
the input is specified by a probability distribution. We consider the well-studied paradigm of …