ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators.
Mark de BergPublished in: CCCG (2019)
Keyphrases
- optimization problems
- computational geometry
- related problems
- practical problems
- orders of magnitude
- run times
- learning algorithm
- worst case
- benchmark problems
- approximate solutions
- difficult problems
- geometric constraints
- theoretical analysis
- computational complexity
- computational cost
- computationally efficient
- combinatorial optimization
- graph theory
- computational problems
- significant improvement
- problems in computer vision
- generalization error bounds
- computer vision
- np hard problems
- exact algorithms
- lower bound
- artificial neural networks
- search problems
- heuristic methods
- np complete
- network model
- machine learning
- network traffic