489 search results - page 13 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
146
Voted
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
110
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
159
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
135
Voted
IJKESDP
2010
15 years 2 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
110
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...