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
30
click to vote
ISAAC
1993
Springer
favorite
Email
discuss
report
106
views
Algorithms
»
more
ISAAC 1993
»
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
14 years 3 months ago
Download
www.cs.gsu.edu
Ulrich Fößmeier, Michael Kaufmann, Alex
Real-time Traffic
Algorithms
|
ISAAC 1993
|
claim paper
Related Content
»
A new heuristic for rectilinear Steiner trees
»
FasterDSP A Faster Approximation Algorithm for Directed Steiner Tree Problem
»
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
»
Minimum moment Steiner trees
»
FOARS FLUTE based obstacleavoiding rectilinear steiner tree construction
»
A Fast and Stable Algorithm for ObstacleAvoiding Rectilinear Steiner Minimal Tree Construc...
»
The polygonal contraction heuristic for rectilinear Steiner tree construction
»
The rectilinear Steiner arborescence problem is NPcomplete
»
Probabilitybased approach to rectilinear Steiner tree problems
more »
Post Info
More Details (n/a)
Added
09 Aug 2010
Updated
09 Aug 2010
Type
Conference
Year
1993
Where
ISAAC
Authors
Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision