"Minimum-Link Rectilinear Covering Tour is NP-hard in R4."

Bhadrachalam Chitturi, Jayakumar Pai (2018)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-10-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics