Approximation Results Toward Nearest Neighbor Heuristic
Jérôme Monnot (2002)
The Yugoslav Journal of Operations Research
Similarity:
Jérôme Monnot (2002)
The Yugoslav Journal of Operations Research
Similarity:
V. Th. Paschos (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Marc Demange, Bernard Kouakou, Eric Soutif (2011)
The Yugoslav Journal of Operations Research
Similarity:
He, G., Liu, J., Zhao, C. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Ján Plesník (1988)
Mathematica Slovaca
Similarity:
Vangelis Th. Paschos (2009)
The Yugoslav Journal of Operations Research
Similarity:
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
Marc Demange (2003)
The Yugoslav Journal of Operations Research
Similarity:
Jérôme Monnot (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper, we focus on some specific optimization problems from graph theory, those for which all feasible solutions have an equal size that depends on the instance size. Once having provided a formal definition of this class of problems, we try to extract some of its basic properties; most of these are deduced from the equivalence, under differential approximation, between two versions of a problem which only differ on a linear transformation of their objective functions. This...
Morgan, Kerri, Farr, Graham (2007)
Journal of Graph Algorithms and Applications
Similarity: