Results 1  10
of
16
Spanning Trees and Spanners
, 1996
"... We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and lowdilation graphs. 1 Introduction This survey covers topics in geometric network design theory. The problem is easy to state: connect a collection of sites by a "good" network. ..."
Abstract

Cited by 139 (2 self)
 Add to MetaCart
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and lowdilation graphs. 1 Introduction This survey covers topics in geometric network design theory. The problem is easy to state: connect a collection of sites by a "good" network. For instance, one may wish to connect components of a VLSI circuit by networks of wires, in a way that uses little surface area on the chip, draws little power, and propagates signals quickly. Similar problems come up in other applications such as telecommunications, road network design, and medical imaging [1]. One network design problem, the Traveling Salesman problem, is sufficiently important to have whole books devoted to it [79]. Problems involving some form of geometric minimum or maximum spanning tree also arise in the solution of other geometric problems such as clustering [12], mesh generation [56], and robot motion planning [93]. One can vary the network design problem in many w...
On the complexity of computing minimum energy consumption broadcast subgraphs
 in Symposium on Theoretical Aspects of Computer Science
, 2001
"... Abstract. We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we consider this problem as a special case of the following more general combinatorial optimization problem, calle ..."
Abstract

Cited by 96 (11 self)
 Add to MetaCart
Abstract. We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we consider this problem as a special case of the following more general combinatorial optimization problem, called Minimum Energy Consumption Broadcast Subgraph (in short, MECBS): Given a weighted directed graph and a specified source node, find a minimum cost range assignment to the nodes, whose corresponding transmission graph contains a spanning tree rooted at the source node. We first prove that MECBS is not approximable within a constant factor (unless P=NP). We then consider the restriction of MECBS to wireless networks and we prove several positive and negative results, depending on the geometric space dimension and on the distancepower gradient. The main result is a polynomialtime approximation algorithm for the NPhard case in which both the dimension and the gradient are equal to 2: This algorithm can be generalized to the case in which the gradient is greater than or equal to the dimension. 1
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
 In Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an ngon with r reflex vertices in time O(n 1+" +n 8=11+" r ..."
Abstract

Cited by 46 (0 self)
 Add to MetaCart
The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an ngon with r reflex vertices in time O(n 1+" +n 8=11+" r 9=11+" ), for any fixed " ? 0, improving the previous best upper bound of O(nr log n). Our algorithm simulates the sequence of collisions between edges and vertices during the shrinking process, using a technique of Eppstein for maintaining extrema of binary functions to reduce the problem of finding successive interactions to two dynamic range query problems: (1) maintain a changing set of triangles in IR 3 and answer queries asking which triangle would be first hit by a query ray, and (2) maintain a changing set of rays in IR 3 and answer queries asking for the lowest intersection of any ray with a query triangle. We also exploit a novel characterization of the straight skeleton as a ...
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions
, 1995
"... We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n 1/2 log 2 n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n # ) per update. Our algorithm uses a novel ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n 1/2 log 2 n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n # ) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher dimensions, and to fully dynamic algorithms for maintaining minima of binary functions, including the diameter of a point set and the bichromatic farthest pair. 1 Introduction A dynamic geometric data structure is one that maintains the solution to some problem, defined on a geometric input such as a point set, as the input undergoes update operations such as insertions or deletions of single points. Dynamic algorithms have been studied for many geometric optimization problems, including closest pairs [7, 23, 25, 26], diameter [7, 26], width [4], convex hulls [15, 22], linear ...
Finding the k Smallest Spanning Trees
, 1992
"... We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log #(m, n)+k 2 ); for planar graphs this bound can be improved to O(n + k 2 ). We also show that the k best spanning trees for a set of ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log #(m, n)+k 2 ); for planar graphs this bound can be improved to O(n + k 2 ). We also show that the k best spanning trees for a set of points in the plane can be computed in time O(min(k 2 n + n log n, k 2 + kn log(n/k))). The k best orthogonal spanning trees in the plane can be found in time O(n log n + kn log log(n/k)+k 2 ).
On Certificates and Lookahead in Dynamic Graph Problems
, 1996
"... Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such as connectivity. However, no efficient deterministic algorithms are known for the dynamic versions of fundamental directed graph problems like strong connectivity and transitive closur ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such as connectivity. However, no efficient deterministic algorithms are known for the dynamic versions of fundamental directed graph problems like strong connectivity and transitive closure, as well as some undirected graph problems such as maximum matchings and cuts. We provide some explanation for this lack of success by presenting quadratic lower bounds on the certificate complexity of the seemingly difficult problems, in contrast to the known linear certificate complexity for the problems which have efficient dynamic algorithms. A direct outcome of our lower bounds is the demonstration that a generic technique for designing efficient dynamic graph algorithms, viz., sparsification, will not apply to the difficult problems. More generally, it is our belief that the boundary between tractable and intractable dynamic graph problems can be demarcated in terms of certificate co...
On the Approximation Ratio of the MSTbased Heuristic for the EnergyEfficient Broadcast Problem in Static AdHoc Radio Networks
 Problem in Static AdHoc Radio Networks. Int. Parallel and Distributed Processing Sympos. (IPDPS
, 2003
"... We present a new analysis of the approximation ratio of the MSTbased heuristic [1] for the Minimum Energy Broadcast Problem in AdHoc Radio Networks. ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We present a new analysis of the approximation ratio of the MSTbased heuristic [1] for the Minimum Energy Broadcast Problem in AdHoc Radio Networks.
Average case analysis of dynamic geometric optimization
, 1995
"... We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log³ n) expected time per update in Mulmuley’s averagecase model of dynamic geometric computation. We use as subroutines dynamic algorithms for two other geometric graphs: the farthest neighbor fore ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log³ n) expected time per update in Mulmuley’s averagecase model of dynamic geometric computation. We use as subroutines dynamic algorithms for two other geometric graphs: the farthest neighbor forest and the rotating caliper graph related to an algorithm for static computation of point set widths and diameters. We maintain the former graph in expected time O(log² n) per update and the latter in expected time O(log n) per update. We also use the rotating caliper graph to maintain the diameter, width, and minimum enclosing rectangle of a point set in expected time O(log n) per update. A subproblem uses a technique for averagecase orthogonal range search that may also be of interest.
Towards optimal I/O scheduling for MEMSbased storage
 IEEE Symposium on Mass Storage Systems (San Diego, CA
, 2003
"... MEMSbased storage devices are currently being developed to narrow the gap between processor and disk speeds. MEMSbased storage devices have a different architecture from disk devices, thus algorithms, such as I/O scheduling and data placement, designed for disks need to be revisited. In this paper ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
MEMSbased storage devices are currently being developed to narrow the gap between processor and disk speeds. MEMSbased storage devices have a different architecture from disk devices, thus algorithms, such as I/O scheduling and data placement, designed for disks need to be revisited. In this paper, we focus on developing an I/O scheduling algorithm for MEMSbased storage devices. Our theoretical analysis shows that this algorithm is guaranteed to perform within twice the optimal time for any workload. 1.
Clustering for Faster Network Simplex Pivots
, 2000
"... We show how to use a combination of treeclustering techniques and computational geometry to improve the time bounds for optimal pivot selection in the primal network simplex algorithm for minimumcost flow and related problems and for pivot execution in the dual network simplex algorithm, from O(m) ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We show how to use a combination of treeclustering techniques and computational geometry to improve the time bounds for optimal pivot selection in the primal network simplex algorithm for minimumcost flow and related problems and for pivot execution in the dual network simplex algorithm, from O(m) to O (√m) per pivot. Our techniques can also speed up network simplex algorithms for generalized flow, shortest paths with negative edges, maximum flow, the assignment problem, and the transshipment problem.