Sciweavers

374 search results - page 41 / 75
» Lower-bounded facility location
Sort
View
FSTTCS
1993
Springer
14 years 1 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
JSAC
2007
128views more  JSAC 2007»
13 years 9 months ago
Location-Aware Services over Vehicular Ad-Hoc Networks using Car-to-Car Communication
Abstract— Recent advances in wireless inter-vehicle communication systems enable the establishment of Vehicular Ad-hoc Networks (VANET) and create significant opportunities for ...
Marios D. Dikaiakos, Andreas Florides, Tamer Nadee...
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
14 years 21 days ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
SIROCCO
2004
13 years 10 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
CAISE
2003
Springer
14 years 2 months ago
Infrastructure Support for Contextual Applications - An Experience Report
Abstract. In this article we report our experience on building a contextual application with two different middlewares: the Context Toolkit from Georgia Tech and the Coordination L...
Damián Arregui, Sophie Dupuy-Chessa, Martin...