Abstract
In this paper, we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance-graph (which has n vertices) is revealed in t clusters, 2 ≤ t ≤ n. We first focus on the on-line version of the following problem: finding a maximum-weighted subgraph satisfying some hereditary property. Then, we deal with the particular case of the independent set. For all these problems, we are interested in two types of results: the competitivity ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problems and for the quality of algorithms developed to solve them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demange, M.: Reduction off-line to on-line: an example and its applications. Yugoslav Journal of Operations Research 13(1), 3–24 (2003)
Demange, M., Paschos, V.T.: Improved approximations for weighted and unweighted graph problems. Theory of Computing Systems (to appear)
Demange, M., Paradon, X., Paschos, V.T.: On-line maximun-order induced hereditary subgraph problems. International Transaction in Operational Research 12(2), 185–201 (2005)
Halldòrsson, M.M.: Approximations of weighted independent set and heditary subset problems. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 261–270. Springer, Heidelberg (1999)
Crescenzi, P., Silvestri, R., Trevisan, L.: To weight or not to weight: where is the question? In: Proc. 4th Israel Symposium on Theory and Computing and Systems, pp. 68–77. IEEE Computer Society, Los Alamitos (1996)
Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completness. CA. Freeman, San Francisco (1979)
Paradon, X.: Algorithmique on-line. Thèse de doctorat, Université Paris Dauphine (2000) (in french)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demange, M., Kouakou, B., Soutif, É. (2005). On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_44
Download citation
DOI: https://doi.org/10.1007/11602613_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)