English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Extending Reduction Techniques for the Steiner Tree Problem

Polzin, T., & Vahdati Daneshmand, S. (2002). Extending Reduction Techniques for the Steiner Tree Problem. In Algorithms - ESA 2002: 10th Annual European Symposium (pp. 795-807). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F76-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2F79-8
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Polzin, Tobias1, Author           
Vahdati Daneshmand, Siavash, Author
Möhring, Rolf, Editor
Raman, Rajeev1, Editor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2003-08-272002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202100
Other: Local-ID: C1256428004B93B8-C3969E020381D9A9C1256C720046D456-Polzin2002-ESA
 Degree: -

Event

show
hide
Title: ESA 2002
Place of Event: Rom, Italy
Start-/End Date: 2002-09-17 - 2002-09-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms - ESA 2002 : 10th Annual European Symposium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 795 - 807 Identifier: ISBN: 3-540-44180-8

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2461 Sequence Number: - Start / End Page: - Identifier: -