465 search results - page 11 / 93 » On the Hardness of Range Assignment Problems |
ECCC
2006
14 years 9 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
68
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
86
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...