Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36939
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, W. | - |
dc.contributor.author | Chin, F. | - |
dc.contributor.author | Zhang, Y. | - |
dc.contributor.author | Zhu, H. | - |
dc.contributor.author | Shen, H. | - |
dc.contributor.author | Wong, P. | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Computing and combinatorics : 11th annual international conference, COCOON 2005, Kunming, China, August 16-29, 2005 : proceedings / Lusheng Wang (ed.), pp. 318-328 | - |
dc.identifier.isbn | 3540280618 | - |
dc.identifier.isbn | 9783540280613 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/2440/36939 | - |
dc.description | The original publication is available at www.springerlink.com | - |
dc.description.abstract | We study the off-line broadcast scheduling problem to minimize total (or average) flow time. Assume the server has k pages and the requests arrive at n distinct times, we give the first algorithm to find the optimal schedule for the server with a single channel, in O(k3(n+k)k–1) time. For m-channel case, i.e., the server can broadcast m different pages at a time where m < k, we find the optimal schedule in O(nk–m) time when k and m are constants. In the single channel case, we also give a simple linear-time approximation algorithm to minimize average flow time, which achieves an additive (k–1)/2-approximation. | - |
dc.description.statementofresponsibility | Wun-Tat Chan, Francis Y.L. Chin, Yong Zhang, Hong Zhu, Hong Shen and Prudence W.H. Wong | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.source.uri | http://www.springerlink.com/content/3mm1fk63f9ytnn7r/ | - |
dc.title | Off-Line algorithms for minimizing total flow time in broadcast scheduling | - |
dc.type | Conference paper | - |
dc.contributor.conference | COCOON 2005 (2005 : Kunming Shi, China) | - |
dc.identifier.doi | 10.1007/11533719_33 | - |
dc.publisher.place | Berlin | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648] | - |
Appears in Collections: | Aurora harvest 6 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.