Parameterized (in)approximability of subset problems
Year of publication: |
2014
|
---|---|
Authors: | Bonnet, Édouard ; Paschos, Vangelis Th. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 42.2014, 3, p. 222-225
|
Subject: | Approximation | Complexity | Graph | Parameterized algorithm | Algorithmus | Algorithm | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
The density maximization problem in graphs
Kao, Mong-jen, (2013)
-
The complexity of computing the random priority allocation matrix
Saban, Daniela, (2015)
-
Computing optimal shortcuts for networks
Garijo, Delia, (2019)
- More ...
-
Dual parameterization and parameterized approximability of subset graph problems
Bonnet, Édouard, (2017)
-
Approximation algorithms for the traveling salesman problem
Monnot, Jérôme, (2003)
-
Approximation algorithms for the traveling salesman problem
Monnot, Jérôme, (2003)
- More ...