242 search results - page 25 / 49 » Approximation Algorithms for Multi-Criteria Traveling Salesm... |
117
click to vote
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
52
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
105
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...