Complexity of network synchronization
Journal of the ACM (JACM)
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Reconstructing the shape of a tree from observed dissimilarity data
Advances in Applied Mathematics
Minimum spanning trees in k-dimensional space
SIAM Journal on Computing
Approximating the complete Euclidean graph
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Proceedings of the international symposium on Optimal algorithms
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Approximating Euclidean Distances by Small Degree Graphs
Approximating Euclidean Distances by Small Degree Graphs
Approximation schemes in computational geometry
Approximation schemes in computational geometry
Optimally sparse spanners in 3-dimensional Euclidean space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New results on the old k-opt algorithm for the TSP
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Generating low-degree 2-spanners
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Sparse distance preservers and additive spanners
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Strong Inapproximability of the Basic k-Spanner Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Approximating k-spanner problems for k 2
Theoretical Computer Science
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
Geometric Spanner of Objects under L1 Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Efficient construction of low weight bounded degree planar spanner
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Optimal euclidean spanners: really short, thin and lanky
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
Let G=(V,E) be an n-vertex connected graph with positive edge weights. A subgraph G′ = (V,E′) is a t-spanner of G if for all u, v &egr; V,the weighted distance between u and v in G′ is at most t times the weighted distance between u and v in G. We consider the problem of constructing sparse spanners, and the weight, defined as the sum of the edge weights in the spanner. In this paper, we concentrate on constructing spanners of small weight.For an arbitrary positive edge-weighted graph G, for any t 1, and any &egr;0, we show that a t-spanner of G with weight O(n(2+&egr;)/(t-1) •wt(MST) can be constructed in polynomial time. We also show that (log2n)-spanners of weight O(log n)•wt(MST) can be constructed.We then consider spanners for complete graphs induced by a set of points in d-dimensional real normed space. The weight of an edge xy is the norm of the xy vector. We show that for these graphs, t-spanners with total weight O(log n)•wt(MST) can be constructed in polynomial time.