Packing Steiner trees with identical terminal sets

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

Details

Original languageEnglish
Pages (from-to)1-5
JournalInformation Processing Letters
Volume91
Issue number1
Publication statusPublished - 2004
MoE publication typeA1 Journal article-refereed

    Research areas

  • combinatorial problems, computational complexity, NP-completeness, Steiner tree packing

ID: 3597011