Entry Lepere:2002:AAA from lncs2002a.bib
Last update: Sat Jan 6 02:13:50 MST 2018
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{Lepere:2002:AAA,
author = "R. Lepere and C. Rapine",
title = "An Asymptotic {$ \mathcal {O}(\ln \rho / \ln \ln \rho)
$}-Approximation Algorithm for the Scheduling Problem
with Duplication on Large Communication Delay Graphs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2285",
pages = "154--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:12 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2285.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2002a.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2285/22850154.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2285/22850154.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- Approximation,
2285(0)227,
2292(0)198,
2308(0)314,
2313(0)311,
2328(0)679,
2329(0)910
- Communication,
2268(0)260,
2285(0)27,
2285(0)299,
2295(0)359,
2295(0)369,
2299(0)83,
2299(0)114,
2303(0)295,
2308(0)155,
2315(0)125,
2315(0)174,
2317(0)3,
2317(0)103,
2317(0)356,
2321(0)32,
2326(0)189,
2326(0)241,
2327(0)401,
2328(0)71,
2328(0)97,
2328(0)154,
2329(0)603
- Delay,
2328(0)71
- Duplication,
2278(0)26
- graph,
2265(0)16,
2265(0)60,
2265(0)84,
2265(0)102,
2265(0)115,
2265(0)189,
2265(0)205,
2265(0)220,
2265(0)232,
2265(0)247,
2265(0)261,
2265(0)272,
2265(0)287,
2265(0)312,
2265(0)378,
2265(0)392,
2265(0)407,
2265(0)422,
2265(0)438,
2265(0)442,
2265(0)448,
2265(0)453,
2265(0)457,
2265(0)459,
2265(0)471,
2265(0)483,
2265(0)485,
2269(0)191,
2269(0)285,
2269(0)307,
2269(0)324,
2269(0)337,
2279(0)122,
2279(0)173,
2281(0)616,
2285(0)100,
2285(0)121,
2285(0)501,
2285(0)559,
2286(0)52,
2286(0)209,
2286(0)236,
2286(0)479,
2292(0)84,
2301(0)57,
2303(0)159,
2303(0)326,
2304(0)29,
2309(0)2,
2310(0)168,
2313(0)176,
2317(0)18,
2324(0)159,
2328(0)404,
2329(0)1058
- Large,
2222(0)297,
2238(0)159,
2265(0)75,
2265(0)477,
2280(0)266,
2281(0)123,
2286(0)224,
2287(0)179,
2298(0)86,
2307(0)161,
2308(0)288,
2308(0)346,
2314(0)175,
2324(0)71,
2327(0)370,
2328(0)437,
2329(0)306
- problem,
2277(0)63,
2277(0)145,
2279(0)11,
2279(0)51,
2279(0)61,
2279(0)82,
2279(0)112,
2279(0)132,
2279(0)143,
2279(0)153,
2279(0)173,
2280(0)415,
2285(0)262,
2285(0)513,
2285(0)620,
2286(0)4,
2286(0)105,
2286(0)118,
2286(0)165,
2286(0)263,
2286(0)508,
2286(0)554,
2286(0)613,
2287(0)627,
2289(0)134,
2295(0)175,
2297(0)281,
2301(0)372,
2302(0)157,
2304(0)111,
2308(0)18,
2308(0)42,
2308(0)325,
2310(0)180,
2310(0)295,
2313(0)89,
2317(0)236,
2317(0)264,
2318(0)148,
2318(0)241,
2321(0)23,
2321(0)88,
2322(0)198,
2322(0)268,
2326(0)103,
2328(0)79,
2328(0)194,
2328(0)236,
2328(0)387,
2328(0)395,
2328(0)643,
2328(0)663,
2328(0)679,
2328(0)778,
2328(0)789,
2328(0)797,
2328(0)833,
2328(0)851,
2329(0)286,
2329(0)335,
2329(0)345,
2329(0)468,
2329(0)623,
2329(0)673,
2329(0)733,
2329(0)853,
2329(0)862,
2329(0)881,
2329(0)900
- Scheduling,
2268(0)112,
2279(0)1,
2279(0)41,
2279(0)51,
2280(0)98,
2280(0)113,
2280(0)312,
2285(0)100,
2285(0)166,
2310(0)362,
2315(0)300,
2317(0)264,
2322(0)198,
2326(0)145,
2326(0)197,
2326(0)287,
2327(0)93,
2327(0)479,
2328(0)65,
2328(0)71,
2328(0)79,
2328(0)87,
2328(0)97,
2328(0)115,
2328(0)626,
2329(0)256,
2329(0)633,
2329(0)653