Narrow search
Showing 1 - 7 of 7
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
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
Some tractable instances of interval data minmax regret problems
Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier - In: Operations research letters 36 (2008) 4, pp. 424-429
Persistent link: https://www.econbiz.de/10003786695
Cover Image
Two-stage stochastic matching and spanning tree problems : polynomial instances and approximation
Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; … - In: European journal of operational research : EJOR 205 (2010) 1, pp. 19-30
Persistent link: https://www.econbiz.de/10003958650
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
Dual parameterization and parameterized approximability of subset graph problems
Bonnet, Édouard; Paschos, Vangelis Th. - In: RAIRO / Operations research 51 (2017) 1, pp. 261-266
Persistent link: https://www.econbiz.de/10011774787
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