Steiner Trees with Bounded RC-Delay (Q3453297)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Steiner Trees with Bounded RC-Delay	scientific article

Statements

scholarly article

0 references

Steiner Trees with Bounded RC-Delay (English)

0 references

Rudolf Scheifele

0 references

Approximation and Online Algorithms

0 references

publication date

20 November 2015

0 references

zbMATH Keywords

Steiner trees

0 references

approximation algorithm

0 references

VLSI design

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-18263-6_19

0 references

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

0 references

Steiner Tree Approximation via Iterative Randomized Rounding

0 references

The steiner problem in graphs

0 references

The Rectilinear Steiner Tree Problem is $NP$-Complete

0 references

On Steiner’s Problem with Rectilinear Distance

0 references

Shallow-Light Steiner Arborescences with Vertex Delays

0 references

On Steiner Minimal Trees with Rectilinear Distance

0 references

0 references

Combinatorial optimization. Theory and algorithms.

0 references

Delay-related secondary objectives for rectilinear Steiner minimum trees.

0 references

The rectilinear Steiner arborescence problem

0 references

The Rectilinear Steiner Arborescence Problem Is NP-Complete

0 references

Faster algorithm for optimum Steiner trees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-18263-6_19

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3453297

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3453297&oldid=36214838"