The uniform orientation Steiner tree problem is NP-hard

Marcus Brazil, Martin Zachariasen

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Fingerprint

Dive into the research topics of 'The uniform orientation Steiner tree problem is NP-hard'. Together they form a unique fingerprint.

Keyphrases

Mathematics

Computer Science