This column contains a summary of last year's research on online algorithms presented at the STOC, FOCS, ICALP, ESA, and STACS conferences. Unfortunately, due to space constraints, the report could not be entirely exhaustive, and results from other conferences or journal articles are not covered. We hope that all readers will find in the survey something of interest, to fill those long winter evenings. The papers in the report are organized roughly by applications.
Three dozen papers on online algorithms
SIGACT News Online Algorithms Column 6 Marek Chrobak From the editor: In this quarter s column, Wojciech Jawor presents a review of new results on online algorithms from several last year s conferences. The survey re ects well the new trends in this area, and it should be helpful to those of us that want to catch up on what has been done last year but do not know where to start. The second part of the column contains the report from the OLA 04 workshop in Denmark. As usual, I d like to invite more contributions to this column: surveys, technical articles, reviews, opinions, open problems, conference reports anything related to online algorithms and competitive analysis. If you are considering becoming a guest writer, don t hesitate to email me at marek@cs.ucr.edu. Three Dozen Papers on Online Algorithms Wojciech Jawor Department of Computer Science University of California, Riverside wojtek@cs.ucr.edu This column contains a summary of last year s research on online algorithms presented at the STOC, FOCS, ICALP, ESA, and STACS conferences. Unfortunately, due to space constraints, the report could not be entirely exhaustive, and results from other conferences or journal articles are not covered. We hope that all readers will nd in the survey something of interest, to ll those long winter evenings. The papers in the report are organized roughly by applications. 1.1 Job scheduling Flow and stretch metrics An area of scheduling that has recently received a lot of attention is job scheduling to minimize ow and stretch. A ow of a job is the di erence between its completion time and its release time. A (total) ow of a schedule is the sum of the ows of the completed jobs. A stretch of a job is its Department of Computer Science, University of California, Riverside, marek@cs.ucr.edu ACM SIGACT News March 2005 Vol. 36, No. 1 ow divided by its length. These objective functions have many applications that include serving requests at web...
End of preview. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/three-dozen-papers-on-online-algorithms-EgPx5S0poI
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Three dozen papers on online algorithms
Jawor, Wojciech
Follow ACM SIGACT News
, Volume 36 (1)
Association for Computing Machinery – Mar 1, 2005
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
