1429 search results - page 3 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
FCT
2003
Springer
13 years 11 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
INFOCOM
2000
IEEE
13 years 10 months ago
2000
IEEE
Abstract—We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link...
HICSS
2003
IEEE
13 years 11 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
GLOBECOM
2006
IEEE
14 years 2 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
NETWORKS
2010
13 years 4 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...