Packing Steiner trees with identical terminal sets

Reference:

Petteri Kaski. Packing Steiner trees with identical terminal sets. Information Processing Letters, 91(1):1–5, 2004.

Keywords:

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

Suggested BibTeX entry:

@article{Kaski04,
    author = {Petteri Kaski},
    journal = {Information Processing Letters},
    number = {1},
    pages = {1--5},
    title = {Packing {S}teiner trees with identical terminal sets},
    volume = {91},
    year = {2004},
}