33 search results - page 7 / 7 » Polynomial-Time Approximation Schemes for Subset-Connectivit... |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...