Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem.•A refined complexity analysis.•Experimental results showing the scalability of this approach. Given a set P of n points with their pairwise distances, t...
Saved in:
| Published in: | European journal of operational research Vol. 270; no. 2; pp. 419 - 429 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
16.10.2018
Elsevier |
| Subjects: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!