scientific article; zbMATH DE number 7561717
From MaRDI portal
Publication:5092436
DOI10.4230/LIPIcs.MFCS.2019.73MaRDI QIDQ5092436
Takeaki Uno, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Kunihiro Wasa, Alessio Conte
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Computational aspects of monotone dualization: a brief survey
- Finding induced trees
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Connecting Terminals and 2-Disjoint Connected Subgraphs
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay
- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes
- On the Complexity of Some Enumeration Problems for Matroids
