4843 search results - page 170 / 969 » The Shortcut Problem - Complexity and Approximation |
138
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
124
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
180
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
126
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
152
Voted
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...