Skip to main content
SpringerLink
Log in

Competitive Analysis for Multi-objective Online Algorithms

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8973))

Included in the following conference series:

Abstract

So far, the concept of competitive analysis for online problems is in general applied to single-objective online problems. However, many online problems can be extended to multi-objective online problems in a natural way, but a uniform theory for the analysis of these problems is not provided in the literature. We expand the concept of competitive analysis to multi-objective online problems and achieve a consistent framework for the analysis of multi-objective online problems. Furthermore, we analyze the multi-objective time series search problem and present deterministic algorithms with best possible competitive ratios.

An Erratum for this chapter can be found at http://dx.doi.org/10.1007/978-3-319-15612-5_31

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bazgan, C., Gourvès, L., Monnot, J.: Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 233–246. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)

    Google Scholar 

  3. Ehrgott, M.: Multicriteria Optimization. Springer (2005)

    Google Scholar 

  4. El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica 30(1), 101–139 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Erlebach, T., Kellerer, H., Pferschy, U.: Approximating Multiobjective Knapsack Problems. Management Sciences 48(12), 1603–1612 (2002)

    Article  MATH  Google Scholar 

  6. Fiat, A. (ed.): Online Algorithms 1996. LNCS, vol. 1442. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  7. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 617–643 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theoretical Computer Science 130, 17–47 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM Symposium on the Theory of Computing (STOC), pp. 140–149 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DFG RTG 1703, Institute for Numerical and Applied Mathematics, University of Göttingen, Lotzestr. 16-18, D-37083, Göttingen, Germany

    Morten Tiedemann, Jonas Ide & Anita Schöbel

Authors
  1. Morten Tiedemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jonas Ide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anita Schöbel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of CSE, BUET, ECE Building, West Palasi, 1205, Dhaka, Bangladesh

    M. Sohel Rahman

  2. The Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofugaoka 1-5-1, 182-8585, Chofu, Tokyo, Japan

    Etsuji Tomita

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tiedemann, M., Ide, J., Schöbel, A. (2015). Competitive Analysis for Multi-objective Online Algorithms. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15612-5_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15611-8

  • Online ISBN: 978-3-319-15612-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation