On conflict-free spanning tree: algorithms and complexity

DOI10.1007/978-3-030-95018-7_8OpenAlexW4206994393MaRDI QIDQ6102267

Uéverton S. Souza, Rian Gabriel S. Pinheiro, Bruno José S. Barros, Luiz Satoru Ochi

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_8

zbMATH Keywords

approximationspanning treeFPTconflict-free

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The minimum spanning tree problem with conflict constraints and its variations
• Paths, trees and matchings under disjunctive constraints
• Heuristics and lower bounds for the bin packing problem with conflicts
• Faster parameterized algorithm for cluster vertex deletion
• A unifying model for locally constrained spanning tree problems
• The Knapsack Problem with Conflict Graphs
• Determining a Minimum Spanning Tree with Disjunctive Constraints
• On the History of the Minimum Spanning Tree Problem

This page was built for publication: On conflict-free spanning tree: algorithms and complexity