On the Steiner Tree 3/2-Approximation For Quasi-Bipartite Graphs (1999)
by
Romeo Rizzi
,
Romeo Rizzi
,
Romeo Rizzi
| Citations: | 1 - 0 self |
BibTeX
@MISC{Rizzi99onthe,
author = {Romeo Rizzi and Romeo Rizzi and Romeo Rizzi},
title = {On the Steiner Tree 3/2-Approximation For Quasi-Bipartite Graphs},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
IR + be a non-negative weighting of the edges of G. Assume V is partitioned as R X . A Steiner tree is any tree T of G such that every node in R is incident with at least one edge of T . The metric Steiner tree problem asks for a Steiner tree of minimum weight, given that w is a metric. When X is a stable set of G, then (G, R, X) is called quasibipartite.
Citations
| 102 | Structural operational semantics - Aceto, Fokkink, et al. |
| 13 | Is your model checker on time? On the complexity of model checking for timed modal logics - Aceto, Laroussinie |
| 8 | Foundational and mathematical uses of higher types - Kohlenbach - 2002 |
| 2 | Luca Cattani and Glynn Winskel. Presheaf Models for CCS-like Languages - Gian - 1999 |
| 1 | Linear Time Recognition of P 4 -Indifferent Graphs - Rizzi - 1999 |
| 1 | Jord an and Zolt an Szigeti. Detachments Preserving Local Edge-Connectivity of Graphs - Tibor - 1999 |
| 1 | Zolt an Esik, and Anna Ing olfsd ottir. The MaxPlus Algebra of the Natural Numbers has no Finite Equational Basis - Aceto - 1999 |
