265 search results - page 48 / 53 » Algorithms for Terminal Steiner Trees |
SIAMCOMP
2010
13 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
—The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in ...
FUIN
2007
13 years 7 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...