4843 search results - page 360 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
DCG
2008
15 years 4 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
130
click to vote
SIAMDM
2002
15 years 4 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
132
click to vote
CCCG
2007
15 years 5 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
144
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...