On the minimum diameter spanning tree problem

Authors:
Refael Hassin;Arie Tamir
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1995

Citing 4
Cited 16

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Improved complexity bounds for center location problems on networks by using dynamic data structures

SIAM Journal on Discrete Mathematics
Minimum diameter spanning trees and related problems

SIAM Journal on Computing
On Shortest Networks for Classes of Points in the Plane

CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications

On-line Algorithms for Edge-Disjoint Paths in Trees of Rings

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Minimum Restricted Diameter Spanning Trees

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
On Minimum Diameter Spanning Trees under Reload Costs

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minimum cut bases in undirected networks

Discrete Applied Mathematics
Some new cooperative coverage facility location games

Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
SyncCast: synchronized dissemination in multi-site interactive 3D tele-immersion

MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems
Strongly polynomial-time truthful mechanisms in one shot

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The fuzzy weighted k-cardinality tree and its hybrid genetic algorithm

FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Combinatorial network abstraction by trees and distances

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximating the statistics of various properties in randomly weighted graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

Discrete Applied Mathematics
Multichannel scheduling and spanning trees: throughput-delay tradeoff for fast data collection in sensor networks

IEEE/ACM Transactions on Networking (TON)
Bounded-degree minimum-radius spanning trees in wireless sensor networks

Theoretical Computer Science
Minimum diameter cost-constrained Steiner trees

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.90

Visualization

Abstract

We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1-center. We use this relation to solve the diameter problem and an extension of it efficiently.