Samir Khuller, Balaji Raghavachari, Neal Young  Home/Search
Context Related
| drenchedrock.net/neal_academi...LAST.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: drenchedrock.net/neal_academic... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest path tree and a minimum spanning tree. (Update)
Context of citations to this paper: More
...r. This problem can also be seen as a Lagrangian relaxation of the budgeted versions of network design problems studied earlier in [3, 1, 2]. Building on the basic framework developed in [3] Meyerson et al. [4] give a randomized approximation algorithm with an expected ratio of...
Cited by: More
Performance Driven Routing with Multiple Sources - Cong (1997) (Correct)
Trade-offs on the Location of the Core Node in a Network - Macq, Goemans (2004) (Correct)
Energy-Efficient Broadcasting in Ad-Hoc Networks: Combining.. - Penna, Ventre (2003) (Correct)
Active bibliography (related documents): More All
0.2: New Sparseness Results on Graph Spanners - Chandra, Das, Narasimhan, Soares (1992) (Correct)
0.2: Spanning Trees and Spanners - Eppstein (1996) (Correct)
0.1: Performance Optimization of VLSI Interconnect Layout - Cong, He, Koh, Madden (1996) (Correct)
Similar documents based on text: More All
0.2: Burst Segmentation: A New Approach To Reduce Packet Loss In.. - Vokkarane (2001) (Correct)
0.1: A Network-Flow Technique for Finding Low-Weight.. - Fekete, Khuller.. (1996) (Correct)
0.1: A Simple Approximation to Minimum-Delay Routing - Vutukury, Garcia-Luna-Aceves (1999) (Correct)
Related documents from co-citation: More All
9: Zero Skew Clock Routing With Minimum Wirelength - Chao, Hsu et al. - 1992
8: and Packaging for VLSI (context) - Bakoglu - 1990
6: Cost-Sensitive Analysis of Communication Protocols (context) - Awerbuch, Baratz et al. - 1990
BibTeX entry: (Update)
S. Khuller, B. Raghavachari, and N. Young. "Balancing Minimum Spanning Trees and Shortest-Path Trees," Proc. Symp. on Discrete Algorithms, 1993, pp. 243--250. http://citeseer.ist.psu.edu/khuller95balancing.html More
@article{ khuller95balancing,
author = "Samir Khuller and Balaji Raghavachari and Neal E. Young",
title = "Balancing Minimum Spanning Trees and Shortest-Path Trees",
journal = "Algorithmica",
volume = "14",
number = "4",
pages = "305-321",
year = "1995",
url = "citeseer.ist.psu.edu/khuller95balancing.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1989
508 Computational Geometry (context) - Preparata, Shamos - 1985
354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1987
314 Introduction to Parallel Algorithms (context) - J'aJ'a - 1991
175 Shortest Connection Networks and Some Generalizations (context) - Prim - 1957
109 the shortest spanning subtree of a graph and the traveling s.. (context) - Kruskal - 1956
68 Provably good performance-driven global routing (context) - Cong, Kahng et al. - 1992
45 New sparseness results on graph spanners - Chandra, Das et al. - 1992
45 Efficient algorithms for finding minimum spanning trees in u.. (context) - Gabow, Galil et al. - 1986
45 Cost-sensitive analysis of communication protocols (context) - Awerbuch, Baratz et al. - 1990
43 Routing to multiple destinations in computer networks (context) - Bharath-Kumar, Jaffe - 1983
26 Discrete and Computational Geometry (context) - Althofer, Das et al. - 1993
24 There are planar graphs almost as good as the complete graph (context) - Chew - 1989
24 A sparse graph almost as good as the complete graph on point.. (context) - Vaidya - 1991
13 There are planar graphs almost as good as the complete graph.. (context) - Levcopoulos, Lingas - 1992
12 Efficient broadcast and light-weight spanners (context) - Awerbuch, Baratz et al. - 1991
9 Performancedriven global routing for cell based IC's (context) - Cong, Kahng et al. - 1991
1 Provably good algorithms for performance-driven global routi.. (context) - Cong, Kahng et al. - 1992
1 on Principles of Distributed Computing (context) - Peleg, Ullman et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.drenchedrock.net/neal_academic/papers/): More
K-Medians, Facility Location, and the Chernoff-Wald Bound - Young (2000) (Correct)
Randomized Rounding without Solving the Linear Program - Young (1995) (Correct)
Data Collection for the Sloan Digital Sky Survey - A.. - Lupton, Maley, Young (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC