Join Our Newsletter

SODA

2008

ACM

11 years 11 months ago
2008

ACM

SODA

2008

ACM

11 years 11 months ago
2008

ACM

In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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 ...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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...

SODA

2008

ACM

11 years 11 months ago
2008

ACM

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...