Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2000: Algorithms - ESA 2000 pp 191–201Cite as

On Multicriteria Online Problems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1879))

Abstract

In this paper we consider multicriteria formulations of classical online problems where an algorithm must simultaneously perform well with respect to two different cost measures. The performance of the algorithm is compared with that of an adversary that serves the sequence of requests selecting one of the possible optimal offline strategies according to a given selection function. We consider a parametric family of functions based on their monotonicity properties which covers all the possible selections. Then, we provide a universal multicriteria algorithm that can be applied to different online problems. For the multicriteria k-server formulation, for each function class, such an algorithm achieves competitive ratios that are only an O(log W) multiplicative factor away from the corresponding lower bounds that we determine for the class, where W is the maximum edge weight. We then show how to extend our results to other multicriteria online problems sharing similar properties.

Work partially supported by the Italian “Progetto Cofinanziato: Resource Allocation in Computer Networks”.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing 29(2) (1999) 459–473.

    Article  MathSciNet  Google Scholar 

  2. Awerbuch, Azar, Y., Plotkin, S.: Throughput-competitive online routing. Proceedings of 34th Symposium on Foundations of Computer Science (1993) 32–40.

    Google Scholar 

  3. Awerbuch, Azar, Y.: Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. Proceedings of the 35th Symposium Foundations of Computer Science (1994) 240–249.

    Google Scholar 

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

    Google Scholar 

  5. Borodin, A., Linial, N., Saks, M.: An Optimal Online Algorithm for Metrical Task Systems. Proceedings of the 19nd Annual ACM Symposium on the Theory of Computing (1987) 373–382.

    Google Scholar 

  6. Chrobak, M., Larmore, L. L.: The server problem and online games. On-Line Algorithms, Proceedings of a DIMACS Workshop, DIMACS Series in Discrete Mathematics and Computer Science 7 (1991) 11–64, American Mathematical Society, New York.

    Google Scholar 

  7. Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., Young, N. E.: On competitive paging algorithms. Journal of Algorithms. 12 (1991) 685–699.

    Article  MATH  Google Scholar 

  8. Fiat, A., Rabani, Y., Ravid, Y.: Competitive k-server algorithms. Proceedings of the 31th Symposium Foundations of Computer Science (1990) 454–463.

    Google Scholar 

  9. Goel, A., Meyerson, A., Plotkin, S.: Combining Fairness with Throughput: Online Routing with Multiple Objectives. Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (2000).

    Google Scholar 

  10. Graham, R.: Bounds on Certain Multiprocessor Timing Anomalies. SIAM Journal on Applied Mathematics 17 (1969) 416–429.

    Article  MATH  MathSciNet  Google Scholar 

  11. Karlin, A. R., Manasse, M. S., Rudolph, L., Sleator, D. D.: Competitive snoopy caching. Agorithmica 3 (1988) 79–119.

    Article  MATH  MathSciNet  Google Scholar 

  12. Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. Journal of the ACM 42 (1995) 971–983.

    Article  MATH  MathSciNet  Google Scholar 

  13. Krumke, S. O., Noltermeier, H., Wirth, H.-C., Marathe, M. V., Ravi, R., Ravi, S. S., Sundaram, R.: Improving spanning trees by upgrading nodes. Theoretical Computer Science 221 (1999) 139–155.

    Article  MATH  MathSciNet  Google Scholar 

  14. Lin, J. H., Vitter, J. S.: ∈-approximations with minimum packing constraint violation. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (1992) 771–782.

    Google Scholar 

  15. Manasse, M. S., McGeoch, L. A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms 11 (1990) 208–230.

    Article  MATH  MathSciNet  Google Scholar 

  16. Marathe, M. V., Ravi R., Sundaram, R.: Service constrained network design problems. Proceedings of the Scandinavian Workshop on Algorithmic Theory’ 96, LNCS Vol. 1097 (1996) 28–40.

    Google Scholar 

  17. Marathe, M. V., Ravi, R., Sundaram, R., Ravi, S. S., Rosenkrantz, D. J., Hunt, H. Bicriteria Network Design Problems. Proceedings of the 22th ICALP, LNCS Vol. 944 (1995) 487–498.

    Google Scholar 

  18. Ravi, R.: Rapid Rumor Ramification: Approximating the minimum broadcast time. Proceedings of the 25th Annual IEEE Foundations of Computer Science (1994) 202–213.

    Google Scholar 

  19. Ravi, R., Goemans, M. X.: The constrained Minimum Spanning Tree Problem. Proceedings of the Scandinavian Workshop on Algorithmic Theory’ 96, LNCS Vol. 1097 (1996) 66–75.

    Google Scholar 

  20. Ravi, R., Marathe, M. V., Ravi, S. S., Sundaram, R., Rosenkrantz, D. J., Hunt, H. Many Birds with one stone: Multi-objective approximation algorithms. Proc. of the 25th Annual ACM Symposium on Theory of Computing (1993) 438–447.

    Google Scholar 

  21. Sleator, D. D., Tarjan, R. E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2) (1985) 202–208.

    Article  MathSciNet  Google Scholar 

  22. Warburton, A.: Approximation of Pareto optima in multiple-objective, shortest path problems. Operations Research 35 (1987) 70–79.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, University of L’Aquila, Via Vetoio loc. Coppito, I-67100, L’Aquila, Italy

    Michele Flammini

  2. Dipartimento di Informatica ed Automazione, University of Roma Tre, Via della Vasca Navale 79, I-00146, Roma, Italy

    Gaia Nicosia

Authors
  1. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gaia Nicosia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK

    Mike S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flammini, M., Nicosia, G. (2000). On Multicriteria Online Problems. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45253-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41004-1

  • Online ISBN: 978-3-540-45253-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation