1480 search results - page 135 / 296 » Distributed algorithms for weighted problems in sparse graph... |
99
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
SODA
2007
ACM
15 years 2 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
99
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
95
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
110
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...