How to Allocate Network Centers (1992)

Cached

Download Links

by Judit Bar-ilan , Guy Kortzars , David Peleg
Venue:J. Algorithms
Citations:65 - 2 self

Active Bibliography

5 Facility Location with Dynamic Distance Functions – Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
34 The Capacitated K-Center Problem – Samir Khuller, Yoram J. Sussmann - 1996
3 Steiner Trees and Beyond: Approximation Algorithms for Network Design – Ramamurthy Ravi - 1993
Scheduling Algorithms for . . . – Subramanian Ramanathan - 1992
7 Secure Communication in an Unknown Network Using Certificates – Mike Burmester, Yvo Desmedt
Received (received date) Revised (revised date) – Yvo Desmedt, Yongge Wang, Communicated (name Of
1 Scheduling algorithms for TDMA wireless multihop networks – Petar Djukic - 2008
3 Maximum Flows and Critical Vertices in AND/OR Graphs – Yvo Desmedt, Yongge Wang - 2002
Two O(log k) approximation algorithms for the asymmetric k-center problem – Aaron Archer - 2001
19 The Application of Microeconomics to the Design of Resource Allocation and Control Algorithms – Donald Francis Ferguson - 1989
Cost vs. Quality: Tradeoffs in Communication Networks – Tamar Eilam, Tamar Eilam - 2000
ii Visualizing Categorical Time Series Data with Applications To Computer And Communications Network Traces – Randy L. Ribler, Roger Ehrich, Robert Foutz, Ronald Kriz, Calvin Ribbens, Randy L. Ribler - 1997
Empirical Observations of Probabilistic Heuristics for the Clustering Problem – Jeff Bilmes, Amin Vahdat, Windsor Hsu, Eun-Jin Im - 1997
Node-Optimal Connected – Subgraphs Dorit Hochbaum, Dorit S. Hochbaum, Anu Pathria
Node Weighted Network Upgrade Problems (Extended Abstract) – S. O. Krumke, H. Noltemeier, M. V. Marathe, S. S. Ravi - 1997
3 Generalized p-Center Problems: Complexity Results and Approximation Algorithms – Dorit S. Hochbaum, Anu Pathria - 1996
2 Asymmetry in k-Center Variants – Inge Li Gørtz, Anthony Wirth - 2003
Algorithm Design and Analysis – Stefan Buettcher, Prof Timothy Chan
Bottleneck Domination and Bottleneck Independent Domination on Graphs * – William Chung-kung Yen