A general framework for enumerating equivalence classes of solutions

DOI10.1007/s00453-023-01131-1arXiv2004.12143MaRDI QIDQ6046942

Blerina Sinaimeri, Marie-France Sagot, Arnaud Mary, Yishu Wang

Publication date: 6 October 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.12143

zbMATH Keywords

dynamic programmingequivalence relationenumeration algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stronger model of dynamic programming algorithms
• An enumeration of the equivalence classes of self-dual matrix codes
• AND/OR search spaces for graphical models
• \(T\)-colorings of graphs: recent results and open problems
• List \(T\)-colorings of graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• Classes of discrete optimization problems and their decision problems
• Efficient computation of substring equivalence classes with suffix arrays
• Nonserial dynamic programming
• Super-Solutions
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A common schema for dynamic programming and branch and bound algorithms
• Dynamic Programming as Graph Searching: An Algebraic Approach
• Minimal Mutation Trees of Sequences
• Optimizing decision trees through heuristically guided search
• The String-to-String Correction Problem
• Complete inverted files for efficient text retrieval and analysis
• Data Mining with Decision Trees
• Finite-State Processes and Dynamic Programming
• Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type

This page was built for publication: A general framework for enumerating equivalence classes of solutions