Entry Nong:2010:PTA 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{Nong:2010:PTA,
author = "Q. Q. Nong and T. C. E. Cheng and C. T. Ng",
title = "A polynomial-time algorithm for the weighted link ring
loading problem with integer demand splitting",
journal = j-THEOR-COMP-SCI,
volume = "411",
number = "31--33",
pages = "2978--2986",
day = "28",
month = jun,
year = "2010",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Aug 31 09:12:40 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
- Cheng, T. C. E.,
411(40)3578,
412(22)2380,
412(29)3731,
457(1)35,
531(z)37
- demand,
413(1)2,
426(1)66
- integer,
412(18)1686,
412(39)5458,
412(52)7087,
454(1)72,
493(z)98,
507(z)34
- link,
411(14)1613,
412(33)4336,
412(40)5602,
412(50)6855,
437(1)1,
518(z)96,
556(z)13
- Ng, C. T.,
411(40)3578,
412(22)2380
- polynomial-time,
412(8)695,
447(1)38,
494(z)144,
553(z)27
- ring,
411(4)823,
411(34)3235,
412(8)783,
412(8)796,
447(1)26,
461(1)106,
469(z)1,
498(z)10,
502(z)64,
509(z)70,
535(z)38
- splitting,
412(18)1669,
412(39)5315,
412(52)7087
- time, polynomial-,
494(z)144
- weighted,
411(3)631,
411(16)1698,
412(4)375,
412(12)1140,
412(19)1782,
412(23)2503,
412(28)3358,
412(41)5700,
412(48)6786,
417(1)2,
418(1)14,
432(1)85,
454(1)136,
459(1)100,
463(1)96,
469(z)105,
470(z)93,
480(z)104,
485(z)38,
502(z)177,
507(z)34,
522(z)85,
534(z)2,
534(z)24,
534(z)69,
534(z)86,
546(z)164,
558(z)107