1542 search results - page 172 / 309 » Kernelization of packing problems |
101
click to vote
ALGOSENSORS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
114
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
101
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
CORR
2010
Springer
15 years 2 days ago
2010
Springer
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
151
click to vote
SIGSOFT
2006
ACM
15 years 7 months ago
2006
ACM
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...