Linear-Delay Enumeration for Minimal Steiner Problems
Summary: Linear-delay, polynomial-space algorithm to enumerate all minimal Steiner trees in directed graphs, improving Kimelfeld & Sagiv; extends to Steiner forests, terminal and directed variants. Also: polynomial-delay, exponential-space enumeration for minimal induced Steiner subgraphs on claw-free graphs; hardness result showing enumeration of minimal group-Steiner trees is at least as hard as minimal hypergraph transversal enumeration. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yasuaki Kobayashi (Hokkaido University)
- 2. Kazuhiro Kurita (National Institute of Informatics)
- 3. Kunihiro Wasa (Toyohashi University of Technology)
BibTeX Citation
@inproceedings{kobayashi_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{Linear-Delay Enumeration for Minimal Steiner Problems}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524148},
doi = {10.1145/3517804.3524148},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kobayashi, Yasuaki and Kurita, Kazuhiro and Wasa, Kunihiro},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,429 | Finding and Approximating Top-k Answers in Keyword Proximity Search | 2006 | PODS | 0.00010811133 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,664 | Optimal Enumeration: Efficient Top-k Tree Matching | 2015 | VLDB |
| 2 | 6,469 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD |
| 3 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 4 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 5 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 6 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 7 | 11,463 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB |
| 8 | 11,691 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |
| 9 | 7,923 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS |
| 10 | 9,337 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS |