Sciweavers

76 search results - page 10 / 16
» Approximating the Minimum Spanning Tree Weight in Sublinear ...
Sort
View
84
Voted
AINA
2009
IEEE
15 years 4 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...
MONET
2006
103views more  MONET 2006»
14 years 9 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
EOR
2007
117views more  EOR 2007»
14 years 9 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
COCOON
2006
Springer
15 years 1 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 3 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis