Sciweavers

169 search results - page 16 / 34
» The Tree of Hubs Location Problem
Sort
View
125
Voted
FOCS
2005
IEEE
15 years 7 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 2 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
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...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
RECOMB
2008
Springer
16 years 2 months ago
Integrating Sequence and Topology for Efficient and Accurate Detection of Horizontal Gene Transfer
Abstract. One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differ...
Cuong Than, Guohua Jin, Luay Nakhleh
INFOCOM
2010
IEEE
15 years 10 days ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
110
Voted
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
15 years 6 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...