Sciweavers

1090 search results - page 16 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Optimal Rate-Reliability-Delay Tradeoff in Networks with Composite Links
—Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, suc...
Ying Li, Mung Chiang, A. Robert Calderbank, Suhas ...
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
13 years 11 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
13 years 11 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
14 years 29 days ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
13 years 11 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang