3875 search results - page 502 / 775 » Approximation algorithms for the 0-extension problem |
201
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
205
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
170
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
207
Voted
STACS
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
177
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...