Books on the topic 'Online algorithms with recourse'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Online algorithms with recourse.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Fiat, Amos, and Gerhard J. Woeginger, eds. Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029561.
Full textKaklamanis, Christos, and Asaf Levin, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2.
Full textKoenemann, Jochen, and Britta Peis, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8.
Full textChalermsook, Parinya, and Bundit Laekhanukit, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6.
Full textBampis, Evripidis, and Ola Svensson, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6.
Full textSanità, Laura, and Martin Skutella, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6.
Full textErlebach, Thomas, and Giuseppe Persiano, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38016-7.
Full textSolis-Oba, Roberto, and Giuseppe Persiano, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29116-6.
Full textJansen, Klaus, and Monaldo Mastrolilli, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51741-4.
Full textSolis-Oba, Roberto, and Rudolf Fleischer, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6.
Full textKaklamanis, Christos, and Kirk Pruhs, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7.
Full textEpstein, Leah, and Thomas Erlebach, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4.
Full textBampis, Evripidis, and Nicole Megow, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39479-0.
Full textErlebach, Thomas, and Christos Kaklamanis, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/11970125.
Full textJansen, Klaus, and Roberto Solis-Oba, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18318-8.
Full textBampis, Evripidis, and Martin Skutella, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93980-1.
Full textKaklamanis, Christos, and Martin Skutella, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77918-6.
Full textPersiano, Giuseppe, and Roberto Solis-Oba, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b106130.
Full textSolis-Oba, Roberto, and Klaus Jansen, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b95598.
Full textErlebach, Thomas, and Giuseppe Persinao, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671411.
Full textBampis, Evripidis, and Klaus Jansen, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12450-1.
Full textByrka, Jarosław, and Andreas Wiese, eds. Approximation and Online Algorithms. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49815-2.
Full textBampis, Evripidis, Klaus Jansen, and Claire Kenyon, eds. Efficient Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671541.
Full textCole, Richard. Online algorithms for finger searching. New York: Courant Institute of Mathematical Sciences, New York University, 1991.
Find full textAmos, Fiat, and Woeginger Gerhard, eds. Online algorithms: The state of the art. Berlin: Springer, 1998.
Find full textDochow, Robert. Online Algorithms for the Portfolio Selection Problem. Wiesbaden: Springer Fachmedien Wiesbaden, 2016. http://dx.doi.org/10.1007/978-3-658-13528-7.
Full textWang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.
Find full textWang, Yu, Shiwen Mao, and R. Mark Nelms. Online Algorithms for Optimal Energy Distribution in Microgrids. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17133-3.
Full textBorodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.
Find full textHentenryck, Pascal Van. Online stochastic combinatorial optimization. Cambridge, Mass: MIT Press, 2009.
Find full textWAOA 2009 (2009 Copenhagen, Denmark). Approximation and online algorithms: 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 ; revised papers. Berlin: Springer, 2010.
Find full textErtekin, Şeyda. Algorithms for efficient learning systems: Online and active learning approaches. Saarbrücken: VDM Verlag Dr. Müller, 2009.
Find full textAngelopoulos, spyros. Efficient online algorithms for multicasting with bandwidth and dealy guarantees. Ottawa: National Library of Canada, 1999.
Find full text1959-, McGeoch Lyle A., Sleator Daniel D. 1953-, and DIMACS (Group), eds. On-line algorithms: Proceedings of a DIMACS workshop, February 11-13, 1991. Providence, R.I: American Mathematical Society, 1992.
Find full textChristos, Kaklamanis, and Skutella Martin, eds. Approximation and online algorithms: 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007 ; revised papers. Berlin: Springer, 2008.
Find full textWAOA 2008 (2008 Karlesruhe, Germany). Approximation and online algorithms: 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008 : revised papers. Berlin: Springer, 2009.
Find full textOnline Algorithms. Cambridge University Press, 2022.
Find full textGiuseppe, Persiano Thomas Erlebach. Approximation and Online Algorithms. Springer, 2008.
Find full textSolis-Oba, Klaus Jansen Roberto. Approximation and Online Algorithms. Springer, 2011.
Find full textPersiano, Roberto Solis-Oba Giuseppe. Approximation and Online Algorithms. Springer, 2008.
Find full textKaklamanis, Thomas Erlebach Christos. Approximation and Online Algorithms. Springer, 2008.
Find full textSkutella, Christos Kaklamanis Martin. Approximation and Online Algorithms. Springer, 2008.
Find full textKlaus, Jansen Evripidis Bampis Claire Kenyon. Efficient Approximation and Online Algorithms. Springer, 2008.
Find full textRaghunathan, Arvind, and Richard Cole. Online Algorithms for Finger Searching. Creative Media Partners, LLC, 2018.
Find full textVishwanathan, Sundar. Online algorithms for graph problems. 1993.
Find full textLi, Bin, and Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 1999.
Find full textLi, Bin, and Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Find full textLi, Bin, and Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Find full textLi, Bin, and Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Find full textLi, Bin, and Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Find full text