17 search results - page 4 / 4 » Choosability in geometric hypergraphs |
COSIT
2007
Springer
13 years 11 months ago
2007
Springer
In order to apply advanced high-level concepts for transportation networks, like hypergraphs, multi-level wayfinding and traffic forecasting, to commercially available street netwo...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...