On the hardness of finding near-optimal multicuts in directed acyclic graphs

Cédric Bentz 1
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01126380
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:52:53 AM
Last modification on : Saturday, January 18, 2020 - 1:03:55 AM

Identifiers

  • HAL Id : hal-01126380, version 1

Collections

Citation

Cédric Bentz. On the hardness of finding near-optimal multicuts in directed acyclic graphs. Theoretical Computer Science, Elsevier, 2011, 412, pp.5325-5332. ⟨hal-01126380⟩

Share

Metrics

Record views

119