Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Friday, September 3, 2021 - 8:22:32 AM
Last modification on : Saturday, September 24, 2022 - 2:36:04 PM
Long-term archiving on: : Saturday, December 4, 2021 - 6:08:11 PM


Publisher files allowed on an open archive



Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. A General Framework for Enumerating Equivalence Classes of Solutions. ESA 2021 - 29th Annual European Symposium on Algorithms, Sep 2021, Virtual, Portugal. pp.1-14, ⟨10.4230/LIPIcs.ESA.2021.80⟩. ⟨hal-03333503⟩



Record views


Files downloads