The Steiner tree problem on graphs: Inapproximability results
- 1 October 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 406 (3) , 207-214
Abstract
No abstract availableKeywords
Funding Information
- Vedecká Grantová Agentúra MŠVVaŠSR a SAV (1/3106/06)
This publication has 7 references indexed in Scilit:
- Some optimal inapproximability resultsJournal of the ACM, 2001
- On the approximability of the traveling salesman problem (extended abstract)2000
- Proof verification and hardness of approximation problems1992
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989
- Ramanujan graphsCombinatorica, 1988
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking NetworksBell System Technical Journal, 1979