Author:
Bazgan Cristina,Toubaline Sonia,Vanderpooten Daniel
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference19 articles.
1. Arora S, Lund C (1996) Hardness of approximations. In: Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston, pp 399–446
2. Bar-Noy A, Khuller S, Schieber B (1995) The complexity of finding most vital arcs and nodes. Technical report CS-TR-3539, University of Maryland
3. LNCS;C Bazgan,2010
4. LNCS;C Bazgan,2011
5. Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献