Search Sciweavers | Sciweavers

1545 search results - page 6 / 309

» On tree congestion of graphs

126

click to vote

ECCC
2007

147views more ECCC 2007»

Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs

14 years 9 months ago

Download www.cs.cmu.edu

In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...

Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...

claim paper

Read More »

Voted

WSC
2001

88views Modeling And Simulation» more WSC 2001»

Resource graphs for modeling large-scale, highly congested systems

14 years 11 months ago

Download www.informs-sim.org

Simulations often execute too slowly to be effective tools for decision-making. In particular, this problem has been found in semiconductor manufacturing where conventional job-dr...

Paul Hyden, Lee Schruben, Theresa M. Roeder

claim paper

Read More »

click to vote

STOC
2007
ACM

134views Algorithms» more STOC 2007»

Hardness of routing with congestion in directed graphs

15 years 10 months ago

Download www.cs.washington.edu

Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...

Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...

claim paper

Read More »

click to vote

CORR
2010
Springer

39views Education» more CORR 2010»

Congestion in planar graphs with demands on faces

14 years 7 months ago

Download assert-false.net

Guyslain Naves, Christophe Weibel

claim paper

Read More »