Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7
Year of publication: |
January-March 2018
|
---|---|
Authors: | Paschos, Vangelis Th. |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 52.2018, 1, p. 305-314
|
Subject: | Approximation algorithm | bipartite graph | max k-VERTEX cover | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Approximation of the quadratic knapsack problem
Pferschy, Ulrich, (2016)
- More ...
-
Approximation algorithms for the traveling salesman problem
Monnot, Jérôme, (2003)
-
Approximation algorithms for the traveling salesman problem
Monnot, Jérôme, (2003)
-
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
Demange, Marc, (2005)
- More ...