From Amortized to Worst Case Delay in Enumeration Algorithms

The quality of enumeration algorithms is often measured by their delay, that is, the maximal time spent between the output of two distinct solutions. If the goal is to enumerate \(t\) distinct solutions for any given \(t\), then another relevant measure is the maximal time needed to output \(t\) sol...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-09
Hauptverfasser:	Capelli, Florent, Strozecki, Yann
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Delay Enumeration Search algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!