720 search results - page 54 / 144 » Linear k-arboricities on trees |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
IWPSE
2007
IEEE
14 years 3 months ago
2007
IEEE
Predicting the defects in the next release of a large software system is a very valuable asset for the project manger to plan her resources. In this paper we argue that temporal f...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
DAC
1994
ACM
14 years 24 days ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
CN
2007
13 years 8 months ago
2007
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...