×

Found 24 Documents (Results 1–24)

Online load balancing on related machines. (English) Zbl 1428.68395

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 30-43 (2018).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI arXiv

A competitive flow time algorithm for heterogeneous clusters under polytope constraints. (English) Zbl 1398.90050

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 10, 15 p. (2016).
MSC:  90B35 68W27
PDFBibTeX XMLCite
Full Text: DOI

Competitive analysis of constrained queueing systems. (English) Zbl 1388.68018

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 143, 13 p. (2016).
MSC:  68M20 68W27
PDFBibTeX XMLCite
Full Text: DOI

On the randomized competitive ratio of reordering buffer management with non-uniform costs. (English) Zbl 1422.68269

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 78-90 (2015).
MSC:  68W20 68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI

Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. (English) Zbl 1315.90016

Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 313-322 (2014).
MSC:  90B35 68W27
PDFBibTeX XMLCite
Full Text: DOI

Online non-clairvoyant scheduling to simultaneously minimize all convex functions. (English) Zbl 1407.68562

Raghavendra, Prasad (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 16th international workshop, APPROX 2013, and 17th international workshop, RANDOM 2013, Berkeley, CA, USA, August 21–23, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8096, 142-157 (2013).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI

Online scheduling with general cost functions. (English) Zbl 1423.68610

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1254-1265 (2012).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: Link

Scheduling heterogeneous processors isn’t as easy as you think. (English) Zbl 1421.68248

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1242-1253 (2012).
MSC:  68W27 68M20 90B35
PDFBibTeX XMLCite
Full Text: Link

Secretary problems: laminar matroid and interval scheduling. (English) Zbl 1377.90075

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1265-1274 (2011).
PDFBibTeX XMLCite
Full Text: Link

Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work. (English) Zbl 1377.90026

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 109-119 (2011).
MSC:  90B35 68Q25 68W27
PDFBibTeX XMLCite
Full Text: Link

An online scalable algorithm for minimizing \(\ell_k\)-norms of weighted flow time on unrelated machines. (English) Zbl 1377.90027

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 95-108 (2011).
MSC:  90B35 68Q25 68W27
PDFBibTeX XMLCite
Full Text: Link

New models and algorithms for throughput maximization in broadcast scheduling (extended abstract). (English) Zbl 1314.68406

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 71-82 (2011).
MSC:  68W27 68M20 90B35
PDFBibTeX XMLCite
Full Text: DOI

An online scalable algorithm for average flow time in broadcast scheduling. (English) Zbl 1288.68286

Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1322-1333 (2010).
MSC:  68W27 90B35 68W40
PDFBibTeX XMLCite

Longest wait first for broadcast scheduling (extended abstract). (English) Zbl 1284.68678

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10–11, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-12449-5/pbk). Lecture Notes in Computer Science 5893, 62-74 (2010).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI

Minimizing maximum response time and delay factor in broadcast scheduling. (English) Zbl 1256.68018

Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 444-455 (2009).
MSC:  68M20 68W27
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software