Sciweavers

1433 search results - page 81 / 287
» On Covering Problems of Rado
Sort
View
WG
2004
Springer
15 years 11 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
MFCS
2009
Springer
16 years 26 days ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
ICOIN
2005
Springer
15 years 11 months ago
On the Hidden Terminal Problem in Multi-rate Ad Hoc Wireless Networks
Multi-hop ad hoc wireless networks generally use the IEEE 802.11 Distributed Coordination Function (DCF) MAC protocol, which utilizes the request-to-send/clear-to-send (RTS/CTS) me...
Joon Yoo, Chongkwon Kim
WINE
2005
Springer
135views Economy» more  WINE 2005»
15 years 11 months ago
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
Anthony Man-Cho So, Yinyu Ye
FSTTCS
2004
Springer
15 years 11 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav