Sciweavers

2862 search results - page 13 / 573
» Bicriteria Network Design Problems
Sort
View
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
12 years 10 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 1 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...
SPAA
2004
ACM
14 years 23 days ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
14 years 22 days ago
Cost-Sharing Mechanisms for Network Design
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
Anupam Gupta, Aravind Srinivasan, Éva Tardo...
INFOCOM
2008
IEEE
14 years 1 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang