2137 search results - page 197 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
151
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
217
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
274
click to vote
DC
2011
14 years 6 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
176
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
173
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...