Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract).
Martin Charles GolumbicHaim KaplanRon ShamirPublished in: WG (1993)
Keyphrases
- extended abstract
- optimization problems
- computational complexity
- computational cost
- polynomial time complexity
- related problems
- benchmark problems
- worst case
- learning algorithm
- difficult problems
- computationally efficient
- high computational complexity
- problems in computer vision
- computational issues
- theoretical guarantees
- approximate solutions
- hard problems
- graph theory
- combinatorial optimization
- np complete
- complexity bounds
- exact algorithms
- theoretical analysis
- run times
- space complexity
- computational problems
- search problems
- test problems
- search methods
- data structure