#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1986

2018

- This year (1)
- Last 5 years (6)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Stavros G. Kolliopoulos, Clifford Stein
- Proceedings 38th Annual Symposium on Foundations…
- 1997

In the single-source unsplittable flow problem we are given a graph G, a source vertex s and a set of sinks t/sub 1/, ..., t/sub k/ with associated demands. We seek a single s-t/sub i/ flow path for… (More)

- Stavros G. Kolliopoulos, Clifford Stein
- IPCO
- 1997

In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T}$ of connection requests. Every connection request in ${\cal T}$ is a vertex pair $(s_i,t_i),$ $1 \leq i \leq K.$… (More)

- Stavros G. Kolliopoulos, Neal E. Young
- J. Comput. Syst. Sci.
- 2005

Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{c^Tx:[email protected]?Z"+^n,Ax>=a,Bx==a) and multiplicity constraints (x=

- Stavros G. Kolliopoulos, Clifford Stein
- SIAM J. Comput.
- 2001

In the single-source unsplittable flow problem, we are given a network G, a source vertex s, and k commodities with sinks ti and real-valued demands $\rho_i,$ $1\leq i \leq k.$ We seek to route the… (More)

- George Karakostas, Stavros G. Kolliopoulos
- 45th Annual IEEE Symposium on Foundations of…
- 2004

We examine how the selfish behavior of heterogeneous users in a network can be regulated through economic disincentives, i.e., through the introduction of appropriate taxation. One wants to impose… (More)

- Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
- J. Algorithms
- 2003

We consider the general problem of scheduling a set of jobs where we may choose not to schedule certain jobs, and thereby incur a penalty for each rejected job. More specifically, we focus on… (More)

The Disjoint-Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and ti, for i =… (More)

- Stavros G. Kolliopoulos, Satish Rao
- SIAM J. Comput.
- 2007

This paper provides a randomized approximation scheme for the $k$-median problem when the input points lie in the $d$-dimensional Euclidean space. The worst-case running time is… (More)

- Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
- Proceedings IEEE INFOCOM . Conference on Computer…
- 2000

A basic problem faced by designers of high-bandwidth switches and routers is to provide effective techniques for scheduling the routing of cells through crossbars. The problem is particularly… (More)

- Stavros G. Kolliopoulos, Clifford Stein
- Math. Program.
- 2004

Abstract.In a packing integer program, we are given a matrix $A$ and column vectors $b,c$ with nonnegative entries. We seek a vector $x$ of nonnegative integers, which maximizes $c^{T}x,$ subject to… (More)