ALGORITHMICA 2004

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ALGORITHMICA-2004 Paper

click to vote

ALGORITHMICA
2004

153views more ALGORITHMICA 2004»

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

13 years 4 months ago

Download pluto.huji.ac.il

We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...

Jochen Könemann, Asaf Levin, Amitabh Sinha

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	153	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem	claim
2	150	Sum Coloring of Bipartite Graphs with Bounded Degree	claim
3	132	A General Model for Authenticated Data Structures	claim
4	130	The Power of Priority Algorithms for Facility Location and Set Cover	claim
5	130	Diameter and Treewidth in Minor-Closed Graph Families, Revisited	claim
6	125	Multidimensional Cube Packing	claim
7	112	Maximum Cardinality Search for Computing Minimal Triangulations of Graphs	claim
8	111	Non-Clairvoyant Scheduling for Minimizing Mean Slowdown	claim
9	111	Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems	claim
10	111	The Hausdorff Voronoi Diagram of Point Clusters in the Plane	claim
11	103	Primal-Dual Algorithms for Connected Facility Location Problems	claim
12	96	Algorithms for Minimizing Response Time in Broadcast Scheduling	claim
13	88	Approximating Min Sum Set Cover	claim
14	84	Computing Diameter in the Streaming and Sliding-Window Models	claim
15	74	Three-Dimensional Layers of Maxima	claim
16	65	On-Line Dial-a-Ride Problems Under a Restricted Information Model	claim
17	65	New Techniques for Regular Expression Searching	claim
18	61	Using Nondeterminism to Design Efficient Deterministic Algorithms	claim
19	55	Engineering a Lightweight Suffix Array Construction Algorithm	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers