Matches in DBpedia 2016-04 for { <http://doi.org/10.1007/3-540-45477-2_20> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- 3-540-45477-2_20 contribution "Lower Bounds for Approximation Algorithms for the Steiner Tree Problem".
- 3-540-45477-2_20 doi "10.1007/3-540-45477-2_20".
- 3-540-45477-2_20 first1 "Clemens".
- 3-540-45477-2_20 first2 "Stefan".
- 3-540-45477-2_20 first3 "Till".
- 3-540-45477-2_20 first4 "Hans Jürgen".
- 3-540-45477-2_20 isCitedBy Quasi-bipartite_graph.
- 3-540-45477-2_20 isbn "978-3-540-42707-0".
- 3-540-45477-2_20 last1 "Gröpl".
- 3-540-45477-2_20 last2 "Hougardy".
- 3-540-45477-2_20 last3 "Nierhoff".
- 3-540-45477-2_20 last4 "Prömel".
- 3-540-45477-2_20 pages "217–228".
- 3-540-45477-2_20 publisher "Springer-Verlag, Lecture Notes in Computer Science 2204".
- 3-540-45477-2_20 series "Lecture Notes in Computer Science".
- 3-540-45477-2_20 title "Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001".
- 3-540-45477-2_20 volume "2204".
- 3-540-45477-2_20 year "2001".