A combinatorial algorithm for computing a maximum independent set in a t-perfect graph

Authors:
Friedrich Eisenbrand;Stefan Funke;Naveen Garg;Jochen Könemann
Affiliations:
Max-Planck-institut für Informatik, Stuhlsatzenuhansweg 85, Saarbrücken, Germany;Max-Planck-institut für Informatik, Stuhlsatzenuhansweg 85, Saarbrücken, Germany;Indian Institute of Technology, New Delhi;Carnegie Mellon University, Pittsburgh, PA
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 10
Cited 2

Matrices with the Edmonds-Johnson property

Combinatorica
Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
The Graphs with All Subgraphs T-Perfect

SIAM Journal on Discrete Mathematics
Randomized rounding without solving the linear program

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
Approximation algorithms

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Sequential and Parallel Algorithms for Mixed Packing and Covering

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

Distributed approximation: a survey

ACM SIGACT News
Optimal post-routing redundant via insertion

Proceedings of the 2008 international symposium on Physical design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a combinatorial polynomial time algorithm to compute a maximum stable set of a t-perfect graph. The algorithm rests on an ε-approximation algorithm for general set covering and packing problems and is combinatorial in the sense that it does not use an explicit linear programming algorithm or methods from linear algebra or convex geometry. Instead our algorithm is based on basic arithmetic operations and comparisons of rational numbers which are of polynomial binary encoding size in the input.