Sciweavers

326 search results - page 26 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
118
Voted
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 7 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
JOIN
2007
91views more  JOIN 2007»
15 years 1 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
118
Voted
ICALP
2009
Springer
16 years 2 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann
121
Voted
SIGCOMM
2000
ACM
15 years 6 months ago
SmartBridge: A scalable bridge architecture
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
Thomas L. Rodeheffer, Chandramohan A. Thekkath, Da...
WINET
2010
128views more  WINET 2010»
15 years 7 days ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...