Entry Gozupek:2014:CCM 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{Gozupek:2014:CCM,
author = "Didem G{\"o}z{\"u}pek and Mordechai Shalom and Ariella
Voloshin and Shmuel Zaks",
title = "On the complexity of constructing minimum changeover
cost arborescences",
journal = j-THEOR-COMP-SCI,
volume = "540--541",
number = "??",
pages = "40--52",
day = "26",
month = jun,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 28 08:55:50 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S030439751400245X",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- constructing,
412(22)2237,
432(1)21,
483(z)134
- cost,
411(3)660,
412(12)1066,
412(35)4482,
412(52)7109,
413(1)142,
445(1)36,
447(1)38,
448(1)47,
460(1)42,
481(z)100,
482(z)9,
495(z)37,
497(z)173,
510(z)102,
539(z)38
- minimum,
411(1)44,
411(6)888,
411(25)2406,
411(26)2502,
411(31)2773,
411(40)3685,
412(8)846,
412(12)1275,
412(29)3530,
412(29)3775,
412(32)4092,
412(39)5167,
412(39)5458,
412(50)6897,
412(50)7009,
417(1)2,
418(1)92,
428(1)80,
429(1)36,
429(1)144,
445(1)36,
447(1)2,
447(1)38,
448(1)47,
478(z)127,
481(z)74,
482(z)9,
482(z)33,
489(z)88,
494(z)122,
495(z)37,
497(z)139,
497(z)173,
499(z)88,
505(z)2,
507(z)72,
511(z)85,
530(z)66,
531(z)66,
535(z)54,
540(z)70,
542(z)98,
543(z)1,
547(z)46,
547(z)104,
554(z)275,
560(z)158,
562(z)660
- Shalom, Mordechai,
411(40)3553,
412(52)7109,
560(z)190
- Voloshin, Ariella,
560(z)190
- Zaks, Shmuel,
411(40)3553,
412(52)7109,
560(z)190