13 search results - page 2 / 3 » Traffic grooming in path, star, and tree networks: complexit... |
STOC
2001
ACM
14 years 5 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
SIAMDM
2010
12 years 11 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...