Approximation Algorithms for Min-Distance Problems in DAGs

The min-distance between two nodes \(u, v\) is defined as the minimum of the distance from \(v\) to \(u\) or from \(u\) to \(v\), and is a natural distance metric in DAGs. As with the standard distance problems, the Strong Exponential Time Hypothesis [Impagliazzo-Paturi-Zane 2001, Calabro-Impagliazz...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2022-10
Hauptverfasser:	Dalirrooyfard, Mina, Kaufmann, Jenny
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Boolean algebra Diameters Lower bounds Mathematical analysis Matrix methods Multiplication Shortest-path problems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!