7006 search results - page 366 / 1402 » Approximation Algorithms |
128
click to vote
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
181
click to vote
COMGEO
2012
ACM
14 years 6 days ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
157
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
134
click to vote
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
k- and t-optimality algorithms [9, 6] provide solutions to DCOPs that are optimal in regions characterized by its size and distance respectively. Moreover, they provide quality gu...
155
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...