類似資料

• Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
  著者:: Kobayashi, Yasuaki, 等
  出版事項: (2023)
• Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
  著者:: Kobayashi, Yasuaki, 等
  出版事項: (2020)
• An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
  著者:: Kurita, Kazuhiro, 等
  出版事項: (2022)
• The Complexity of Maximal Common Subsequence Enumeration
  著者:: Buzzega, Giovanni, 等
  出版事項: (2025)
• Parameterized Complexity of Finding Dissimilar Shortest Paths
  著者:: Funayama, Ryo, 等
  出版事項: (2024)