Skip to Main content Skip to Navigation
Conference papers

Steiner Problems with Limited Number of Branching Nodes

Dimitri Watel 1 Marc-Antoine Weisser 1 Cédric Bentz 2 Dominique Barth 3
1 E3S - Supélec Sciences des Systèmes [Gif-sur-Yvette]
2 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
3 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
Keywords : Steiner tree parameterized complexity graph algorithm
Complete list of metadatas
https://hal-supelec.archives-ouvertes.fr/hal-00877222
Contributor : Elodie Dubrac <>
Submitted on : Monday, October 28, 2013 - 9:18:49 AM
Last modification on : Friday, January 24, 2020 - 12:04:01 PM

Identifiers

  • HAL Id : hal-00877222, version 1

Collections

CNRS | PRISM | SUPELEC | UVSQ | CNAM | UNIV-HESAM | SUP_INFO | CEDRIC-CNAM

Citation

Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth. Steiner Problems with Limited Number of Branching Nodes. SIROCCO 2013, Jul 2013, Ischia, Italy. ⟨hal-00877222⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

269

Contact

Informations

CCSD