4843 search results - page 268 / 969 » The Shortcut Problem - Complexity and Approximation |
152
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
123
click to vote
COCOON
2010
Springer
15 years 8 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
145
click to vote
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
160
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
218
click to vote
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...