14165 search results - page 49 / 2833 » The generalized two-server problem |
144
click to vote
IEICET
2011
14 years 9 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
163
Voted
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—Sensor deployment is a fundamental issue in a wireless sensor network, which often dictates the overall network performance. Previous studies on sensor deployment mainly focused...
119
click to vote
JDA
2010
14 years 8 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
149
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
121
click to vote
MST
2010
14 years 8 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...