207 search results - page 34 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
152
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
162
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
175
click to vote
FOCS
1995
IEEE
15 years 8 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
195
click to vote
VTC
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
121
click to vote
DATE
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...