Narrow search
Showing 1 - 5 of 5
Cover Image
Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7
Paschos, Vangelis Th. - In: RAIRO / Operations research 52 (2018) 1, pp. 305-314
Persistent link: https://www.econbiz.de/10011968720
Cover Image
When polynomial approximation meets exact computation
Paschos, Vangelis Th. - In: 4OR : a quarterly journal of operations research 13 (2015) 3, pp. 227-245
Persistent link: https://www.econbiz.de/10011347901
Cover Image
Parameterized (in)approximability of subset problems
Bonnet, Édouard; Paschos, Vangelis Th. - In: Operations research letters 42 (2014) 3, pp. 222-225
Persistent link: https://www.econbiz.de/10010383186
Cover Image
Super-polynomial approximation branching algorithms
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric - In: RAIRO / Operations research 50 (2016) 4/5, pp. 979-994
Persistent link: https://www.econbiz.de/10011687201
Cover Image
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem
Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, … - In: European journal of operational research : EJOR 262 (2017) 3, pp. 894-903
Persistent link: https://www.econbiz.de/10011802282