Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
2. Hochbaum, D.S.: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. European Journal of Operational Research 140, 291–321 (2002)
3. Krumke, S.O., Marathe, M.V., Noltemeier, H., Ravi, R., Ravi, S.S., Sundaram, R., Wirth, H.C.: Improving minimum cost spanning trees by upgrading nodes. Journal of Algorithms 33, 92–111 (1999)
4. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)
5. Nemhauser, G.L., Trotter Jr., L.E.: Vertex packing: structural properties and algorithms. Mathematical Programming 8, 232–248 (1975)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity and Polynomially Solvable Special Cases of QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022
2. Introduction to QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022
3. Generalized vertex cover using chemical reaction optimization;Applied Intelligence;2019-01-25
4. The Multi-radius Cover Problem;Lecture Notes in Computer Science;2005
5. The Computational Complexity of the Minimum Weight Processor Assignment Problem;Graph-Theoretic Concepts in Computer Science;2004