Approximation Algorithms for Routing and Related Problems on Directed Minor-Free Graphs.
- 주제(키워드) Traveling Salesman Problem , Minor-free graphs , Routing problems
- 발행기관 The Ohio State University
- 발행년도 2019
- 학위명 박사
- 학과 및 전공 Computer Science and Engineering
- UCI I804:11009-000000163785
- 제출원본 PQDT27692329
