Sciweavers

315 search results - page 30 / 63
» Eigenvalue bounds for independent sets
Sort
View
IJUFKS
2006
64views more  IJUFKS 2006»
13 years 9 months ago
Cautious Analysis of Project Risks by Interval-Valued Initial Data
One of the most common performance measures in selection and management of projects is the Net Present Value (NPV). In the paper, we study a case when initial data about the NPV p...
Lev V. Utkin
ICALP
2005
Springer
14 years 3 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
13 years 8 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
INFOCOM
2007
IEEE
14 years 4 months ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
AHSWN
2010
102views more  AHSWN 2010»
13 years 10 months ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...