Graph problems with obligations

Abstract : In this paper we study variants of well-known graph problems as vertex cover, spanning tree, matchings, and hamiltonian path. Given a graph G = (V, E), we add a partition Π V (resp. Π E) of its vertices (resp. of its edges). Now, any solution S containing an element (vertex or edge) of a part of this partition must also contain all the others ones. In other words, elements can only be added set by set, instead of one by one as in the classical situation. We propose hardness and approximation results.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01791148
Contributor : Christian Laforest <>
Submitted on : Friday, June 29, 2018 - 9:38:00 AM
Last modification on : Thursday, March 14, 2019 - 12:20:16 PM
Long-term archiving on : Thursday, September 27, 2018 - 8:21:52 AM

File

Optimisation-Avec-Obligations....
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01791148, version 2

Citation

Alexis Cornet, Christian Laforest. Graph problems with obligations. [Research Report] LIMOS (UMR CNRS 6158), université Clermont Auvergne, France. 2018. ⟨hal-01791148v2⟩

Share

Metrics

Record views

97

Files downloads

241