1486 search results - page 54 / 298 » Algorithms for two-box covering |
85
Voted
MMSP
2008
IEEE
15 years 7 months ago
2008
IEEE
A new chroma-based dynamic feature vector is proposed inspired by psychophysical observations that the human auditory system detects relative pitch changes rather than absolute pi...
104
Voted
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
108
Voted
ANTSW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
110
Voted
DAM
2010
15 years 27 days ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
93
Voted
MST
2010
14 years 11 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...