A General Framework for Enumerating Equivalence Classes of Solutions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2023

A General Framework for Enumerating Equivalence Classes of Solutions

Abstract

When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e., to list) them all. Even when the enumeration can be done in polynomial delay, that is, spending no more than polynomial time to go from one solution to the next, this can be costly as the number of solutions themselves may be huge, including sometimes exponential. Furthermore, depending on the application, many of these solutions can be considered equivalent. The problem of an efficient enumeration of the equivalence classes or of one representative per class (without generating all the solutions), although identified as a need in many areas, has been addressed only for very few specific cases. In this paper, we provide a general framework that solves this problem in polynomial delay for a wide variety of contexts, including optimization ones that can be addressed by dynamic programming algorithms, and for certain types of equivalence relations between solutions.
Fichier principal
Vignette du fichier
Wang2023.pdf (505.74 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04365403 , version 1 (28-12-2023)

Licence

Identifiers

Cite

Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. A General Framework for Enumerating Equivalence Classes of Solutions. Algorithmica, 2023, 85 (10), pp.3003-3023. ⟨10.1007/s00453-023-01131-1⟩. ⟨hal-04365403⟩
42 View
6 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More