1545 search results - page 104 / 309 » On tree congestion of graphs |
FOCS
1996
IEEE
15 years 2 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
ORL
2008
14 years 10 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
IPPS
1995
IEEE
15 years 1 months ago
1995
IEEE
The linear systems associated with large, sparse, symmetric, positive deļ¬nite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
FOGA
2007
14 years 11 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
ECCC
2010
14 years 8 months ago
2010
Bodlaenderās Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...