|
 
|
[Ben11] On the hardness of finding near-optimal multicuts in directed acyclic graphs
Revue Internationale avec comité de lecture : Journal Theoretical Computer Science, vol. 412(39), pp. 5325-5332, 2011, (doi:10.1016/j.tcs.2011.06.003)
motcle:
Equipe:
oc
BibTeX
| @article { | |||
| Ben11, | |||
| title | = | "{On the hardness of finding near-optimal multicuts in directed acyclic graphs}", | |
| author | = | "C. Bentz", | |
| journal | = | "Theoretical Computer Science", | |
| year | = | 2011, | |
| volume | = | 412, | |
| number | = | 39, | |
| pages | = | "5325-5332", | |
| doi | = | "10.1016/j.tcs.2011.06.003", | |
| } | |||
