Sciweavers

76 search results - page 7 / 16
» Minimum Spanning Tree on Spatio-Temporal Networks
Sort
View
122
Voted
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 11 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
WINET
2010
128views more  WINET 2010»
14 years 7 months 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, ...
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
14 years 7 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
68
Voted
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
14 years 11 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
85
Voted
STACS
2007
Springer
15 years 3 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth