Sciweavers

349 search results - page 29 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
WINET
2008
86views more  WINET 2008»
13 years 7 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
EOR
2007
198views more  EOR 2007»
13 years 7 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
FOCS
2008
IEEE
14 years 2 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
MST
2010
187views more  MST 2010»
13 years 2 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
SSD
1993
Springer
237views Database» more  SSD 1993»
13 years 12 months ago
A Small Set of Formal Topological Relationships Suitable for End-User Interaction
Topological relationships between spatial objects represent important knowledge that users of geographic information systems expect to retrieve from a spatial database. A di cult t...
Eliseo Clementini, Paolino Di Felice, Peter van Oo...