On-line computation and maximum-weighted hereditary subgraph problems

Authors:
Marc Demange;Bernard Kouakou;Éric Soutif
Affiliations:
SID department, ESSEC, Cergy Pontoise Cedex, France;CERMSEM, Université Paris 1, Paris, France;CEDRIC, CNAM, Paris, France
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 3
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Approximations for Weighted and Unweighted Graph Problems

Theory of Computing Systems
Approximations of weighted independent set and hereditary subset problems

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

2005: an offline persepctive

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

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.