4843 search results - page 337 / 969 » The Shortcut Problem - Complexity and Approximation |
110
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
133
click to vote
COLING
2008
15 years 5 months ago
2008
This paper addresses the fundamental problem of document classification, and we focus attention on classification problems where the classes are mutually exclusive. In the course ...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
139
click to vote
DAM
2008
15 years 4 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
126
click to vote
FSS
2002
15 years 4 months ago
2002
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...