Sciweavers

Share
SODA
2008
ACM
73views Algorithms» more  SODA 2008»
9 years 11 months ago
Set connectivity problems in undirected graphs and the directed Steiner network problem
Chandra Chekuri, Guy Even, Anupam Gupta, Danny Seg...
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
9 years 11 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
9 years 11 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
9 years 11 months ago
Yet another algorithm for dense max cut: go greedy
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
Claire Mathieu, Warren Schudy
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
9 years 11 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
SODA
2008
ACM
70views Algorithms» more  SODA 2008»
9 years 11 months ago
Optimal universal graphs with deterministic embedding
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
Noga Alon, Michael R. Capalbo
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
9 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
9 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
9 years 11 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
9 years 11 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
books