1671 search results - page 298 / 335 » On the Covering Steiner Problem |
SPW
2000
Springer
14 years 2 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
FOCS
1995
IEEE
14 years 2 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
EFDBS
2000
14 years 9 days ago
2000
Today, bibliographical information is kept in a variety of data sources world wide, some of them publically available, and some of them also offering information about citations m...
TAMODIA
2007
14 years 3 days ago
2007
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...
SPAA
2010
ACM
13 years 11 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...