Q5743426 (Q5743426): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 05:09, 19 July 2024

scientific article; zbMATH DE number 7053305

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7053305

Statements

scholarly article

0 references

David Eisenstat

0 references

0 references

Philip N. Klein

0 references

publication date

10 May 2019

0 references

full work available at URL

https://arxiv.org/abs/1110.1320

0 references

https://dl.acm.org/citation.cfm?id=2095169

0 references

MaRDI profile type

MaRDI publication profile

0 references

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

0 references

Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

0 references

The Steiner problem with edge lengths 1 and 2

0 references

0 references

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

0 references

An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs

0 references

0 references

0 references

The Steiner forest problem revisited

0 references

A General Approximation Technique for Constrained Forest Problems

0 references

A data structure for bicategories, with application to speeding up an approximation algorithm

0 references

Fast 3-coloring triangle-free planar graphs

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743426

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