Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives

Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken. Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. In Artur Czumaj, Qin Xin 0001, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands. Volume 227 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.