Graph problems with obligations

DOI10.1007/978-3-030-04651-4_13OpenAlexW2806911001MaRDI QIDQ2327111

Christian Laforest, Alexis Cornet

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_13

zbMATH Keywords

approximation algorithmshardnessgraph problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Introduction to routing problems with mandatory transitions ⋮ Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms ⋮ Constrained hitting set problem with intervals ⋮ On the complexity of independent dominating set with obligations in graphs

This page was built for publication: Graph problems with obligations