Sciweavers

60 search results - page 10 / 12
» Construction of Minimum-Weight Spanners
Sort
View
ESA
2005
Springer
89views Algorithms» more  ESA 2005»
14 years 29 days ago
Experimental Study of Geometric t-Spanners
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
Mohammad Farshi, Joachim Gudmundsson
ICALP
2011
Springer
12 years 11 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
14 years 29 days ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
AHSWN
2005
120views more  AHSWN 2005»
13 years 7 months ago
Low-Interference Topology Control for Wireless Ad Hoc Networks
Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. So...
Kousha Moaveninejad, Xiang-Yang Li
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 7 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy