Extended formulations for vertex cover
Year of publication: |
May 2016
|
---|---|
Authors: | Buchanan, Austin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 3, p. 374-378
|
Subject: | Fixed-parameter tractable | Extended formulation | Vertex cover | Independent set | Cardinality constrained | Hitting set |
-
Why is maximum clique often easy in practice?
Walteros, Jose L., (2020)
-
No small linear program approximates vertex cover within a factor 2 - ɛ
Bazzi, Abbas, (2019)
-
Carousel greedy : a generalized greedy algorithm with applications in optimization
Cerrone, Carmine, (2017)
- More ...
-
On connected dominating sets of restricted diameter
Buchanan, Austin, (2014)
-
An integer programming approach for fault-tolerant connected dominating sets
Buchanan, Austin, (2015)
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
- More ...