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 | Algorithmus | Algorithm | Deskriptive Statistik | Descriptive statistics | Mathematische Optimierung | Mathematical programming |
-
The determination of a graph center
Ioan, Cătălin Angelo, (2018)
-
Online Collaborative-Filtering on Graphs
Banerjee, Siddhartha, (2014)
-
Explainable recommendation based on weighted knowledge graphs and graph convolutional networks
Boughareb, Rima, (2023)
- 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)
-
Paschos, Vangelis Th., (1997)
- More ...