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”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing 29(2) (1999) 459–473.
Awerbuch, Azar, Y., Plotkin, S.: Throughput-competitive online routing. Proceedings of 34th Symposium on Foundations of Computer Science (1993) 32–40.
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.
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998).
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.
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.
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.
Fiat, A., Rabani, Y., Ravid, Y.: Competitive k-server algorithms. Proceedings of the 31th Symposium Foundations of Computer Science (1990) 454–463.
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).
Graham, R.: Bounds on Certain Multiprocessor Timing Anomalies. SIAM Journal on Applied Mathematics 17 (1969) 416–429.
Karlin, A. R., Manasse, M. S., Rudolph, L., Sleator, D. D.: Competitive snoopy caching. Agorithmica 3 (1988) 79–119.
Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. Journal of the ACM 42 (1995) 971–983.
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.
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.
Manasse, M. S., McGeoch, L. A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms 11 (1990) 208–230.
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.
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.
Ravi, R.: Rapid Rumor Ramification: Approximating the minimum broadcast time. Proceedings of the 25th Annual IEEE Foundations of Computer Science (1994) 202–213.
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.
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.
Sleator, D. D., Tarjan, R. E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2) (1985) 202–208.
Warburton, A.: Approximation of Pareto optima in multiple-objective, shortest path problems. Operations Research 35 (1987) 70–79.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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