Cargando…
The Steiner Problem for Count Matroids
We introduce and study a generalization of the well-known Steiner tree problem to count matroids. In the count matroid [Formula: see text], defined on the edge set of a graph [Formula: see text], a set [Formula: see text] is independent if every vertex set [Formula: see text] spans at most [Formula:...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254890/ http://dx.doi.org/10.1007/978-3-030-48966-3_25 |