Entry Bentz:2011:HFN from tcs2010.bib
Last update: Sun Mar 31 03:12:29 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Bentz:2011:HFN,
author = "C{\'e}dric Bentz",
title = "On the hardness of finding near-optimal multicuts in
directed acyclic graphs",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "39",
pages = "5325--5332",
day = "9",
month = sep,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Aug 30 18:51:54 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- acyclic,
411(38)3423,
411(38)3493,
412(29)3795,
450(1)31,
457(1)1,
465(z)35,
481(z)85,
503(z)109,
504(z)5,
513(z)25,
554(z)40
- directed,
411(26)2502,
411(38)3493,
412(4)375,
412(8)901,
412(32)4173,
412(41)5744,
412(41)5752,
412(45)6390,
454(1)30,
457(1)1,
463(1)2,
465(z)35,
468(z)50,
485(z)1,
504(z)5,
513(z)25,
560(z)235
- finding,
411(7)1212,
411(16)1742,
411(26)2475,
412(35)4579,
423(1)50,
428(1)10,
443(1)10,
447(1)74,
462(1)59,
468(z)92,
483(z)10,
491(z)136,
550(z)21,
554(z)2,
556(z)85
- hardness,
412(35)4629,
412(46)6517,
412(49)6795,
429(1)144,
467(z)1,
481(z)18,
482(z)86,
521(z)107,
533(z)15,
562(z)660
- multicut,
520(z)87
- near-optimal,
453(1)14,
497(z)164,
558(z)125
- optimal, near-,
497(z)164