1429 search results - page 56 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
LSSC
2005
Springer
15 years 3 months ago
2005
Springer
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
FCT
2007
Springer
15 years 1 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...