On the hardness of finding near-optimal multicuts in directed acyclic graphs - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2011

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

Cédric Bentz
No file

Dates and versions

hal-01126380 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01126380 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More