909 search results - page 138 / 182 » On the approximability of some network design problems |
SODA
2010
ACM
15 years 11 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
117
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
129
click to vote
DIALM
2003
ACM
15 years 6 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
112
click to vote
MM
2009
ACM
15 years 8 months ago
2009
ACM
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...
108
click to vote
COCOA
2009
Springer
15 years 8 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...