Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
ISAAC
2005
Springer
favorite
Email
discuss
report
100
views
Algorithms
»
more
ISAAC 2005
»
Hardness and Approximation of Octilinear Steiner Trees
14 years 28 days ago
Download
www.zaik.uni-koeln.de
Matthias Müller-Hannemann, Anna Schulze
Real-time Traffic
ISAAC 2005
|
claim paper
Related Content
»
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
»
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
»
Approximating rooted Steiner networks
»
Hardness and Approximation Results for Packing Steiner Trees
»
An Improved LPbased Approximation for Steiner Tree
»
On the Covering Steiner Problem
»
Hardness and Approximation of the Survivable MultiLevel Fat Tree Problem
»
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
»
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
more »
Post Info
More Details (n/a)
Added
27 Jun 2010
Updated
27 Jun 2010
Type
Conference
Year
2005
Where
ISAAC
Authors
Matthias Müller-Hannemann, Anna Schulze
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision