3192 search results - page 132 / 639 » The minimum latency problem |
104
Voted
STACS
2000
Springer
15 years 7 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
150
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
131
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
130
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
125
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...