On-Line Maximum-Order Induced Hereditary Subgraph Problems
We first study the competitivity ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters. Then, we focus ourselves on two of the most known instantiations of this problem, the maximum independent set and the maximum clique.
KeywordsApproximation Ratio Competitivity Ratio Maximum Clique Maximum Clique Problem Hereditary Property
Unable to display preview. Download preview PDF.
- 2.Demange, M., Paschos, V. Th.: Maximum-weight independent set is as “wellapproximated” as the unweighted one. Technical Report 163 (1999) LAMSADE, Université Paris-Dauphine. 332Google Scholar
- 3.Demange, M., Paradon, X., Paschos, V. Th.: On-line maximum-order induced hereditary subgraph problems. Research Note 25 (2000) LAMSADE, Université Paris-Dauphine. 328, 329, 331, 332Google Scholar
- 4.Halldórsson, M. M.: Approximations via partitioning. JAIST Research Report ISRR-95-0003F (1995) Japan Advanced Institute of Science and Technology, Japan. 329Google Scholar