Local approximations for maximum partial subgraph problem

Authors:
JéRôMe Monnot;Vangelis Th. Paschos;Sophie Toulouse
Affiliations:
LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775 Paris, Cedex 16, France;LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775 Paris, Cedex 16, France;LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775 Paris, Cedex 16, France
Venue:
Operations Research Letters
Year:
2004

Citing 8
Cited 1

Approximation properties of NP minimization classes

Journal of Computer and System Sciences
On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
z-Approximations

Journal of Algorithms
On Some Tighter Inapproximability Results (Extended Abstract)

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Approximation of Maximum Subgraph Problems

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
On the complexity of the Maximum Subgraph Problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Local search for the minimum label spanning tree problem with bounded color classes

Operations Research Letters

A survey of approximation results for local search algorithms

Efficient Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We deal with MAXH"0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (@d"0+1)/(B+2+@n"0), where B=max"v"@?"Vd"G(v), @d"0=min"v"@?"V"("H"""0")d"H"""0(v) and @n"0=(|V(H"0)|+1)/@d"0. Next, we show that this ratio rises up to 3/(B+1) when H"0=K"3. Finally, we provide hardness results for MAXK"3-FREE PARTIAL SUBGRAPH.