Author:
Orlin James B.,Punnen Abraham P.,Schulz Andreas S.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
3. Chakravarti, N., Wagelmans, A.P.M.: Calculation of stability radii for combinatorial optimization problems. Operations Research Letters 23, 1–7 (1998)
4. Crescenzi, P., Silvestri, R.: Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems. Information Processing Letters 33, 221–226 (1990)
5. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, pp. 604–612 (2004)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. NP-Completeness;Algorithms and Combinatorics;2018
2. Green Distributed Storage Using Energy Harvesting Nodes;IEEE Journal on Selected Areas in Communications;2016-05
3. Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs;Fundamentals of Computation Theory;2013
4. NP-Vollständigkeit;Kombinatorische Optimierung;2012
5. NP-Completeness;Algorithms and Combinatorics;2011-10-27