Combinatorial Optimization: Algorithms and Complexity
E1170225
UNEXPLORED
Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Combinatorial Optimization: Algorithms and Complexity canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T15667157 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Combinatorial Optimization: Algorithms and Complexity Context triple: [Christos H. Papadimitriou, notableWork, Combinatorial Optimization: Algorithms and Complexity]
-
A.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
B.
Garey and Johnson: Computers and Intractability
"Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
-
C.
Gomory cuts in integer programming
Gomory cuts in integer programming are a class of cutting-plane techniques that iteratively refine linear programming relaxations to find optimal integer solutions to mixed-integer optimization problems.
-
D.
Papadimitriou: Computational Complexity
"Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
-
E.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Combinatorial Optimization: Algorithms and Complexity Target entity description: Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
-
A.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
B.
Garey and Johnson: Computers and Intractability
"Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
-
C.
Gomory cuts in integer programming
Gomory cuts in integer programming are a class of cutting-plane techniques that iteratively refine linear programming relaxations to find optimal integer solutions to mixed-integer optimization problems.
-
D.
Papadimitriou: Computational Complexity
"Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
-
E.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.