Sciweavers

554 search results - page 30 / 111
» Approximation algorithms and hardness results for labeled co...
Sort
View
MOBIHOC
2003
ACM
14 years 7 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
72
Voted
AAIM
2011
Springer
337views Algorithms» more  AAIM 2011»
12 years 11 months ago
On Variants of the Spanning Star Forest Problem
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
Jing He, Hongyu Liang
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
IS
2012
12 years 3 months ago
On the refactoring of activity labels in business process models
Large corporations increasingly utilize business process models for documenting and redesigning their operations. The extent of such modeling initiatives with several hundred mode...
Henrik Leopold, Sergey Smirnov 0002, Jan Mendling
ADHOCNOW
2004
Springer
14 years 1 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi