Efficient Algorithms for the Group Steiner Tree Problem with Many Groups
<p>The datasets for our paper 'Efficient Algorithms for the Group Steiner Tree Problem with Many Groups'. It concludes two datasets: <code>PCSG_dataset</code> and <code>KeywordSearch_dataset</code>.</p> <p><code>PCSG_dataset</code> is in <code>PCSG_dataset.zip</code>.</p> <p>The <code>KeywordSearch_dataset</code> is compressed into several volumes in the following files: <code>KeywordSearch_dataset.zip</code>, <code>KeywordSearch_dataset.z01</code>, <code>KeywordSearch_dataset.z02</code>, <code>KeywordSearch_dataset.z03</code>, <code>KeywordSearch_dataset.z04</code>, <code>KeywordSearch_dataset.z05</code>. We recommend using <code>Bandizip</code> to unzip them.</p>
ShareScore
36/100
Overall dataset sharing score
Score breakdown
These five areas show where the dataset supports — or may limit — practical reuse.
- Stewardship
- 4
- Harmonization
- 4
- Access
- 16
- Reuse readiness
- 8
- Engagement
- 4
Dataset details
- Repository
- zenodo
- Published
- October 12, 2023
- License
- cc-zero
- DOI
- 10.5281/zenodo.8437079
Scored with release 0.9.0
ScienceDex for faculty
Your academic CV and NIH biosketch
Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.