A priori optimization for the probabilistic maximum independent set problem

Authors:
Cécile Murat;Vangelis Th. Paschos
Affiliations:
Univ. Paris-Dauphine, Paris, France;Univ. Paris-Dauphine, Paris, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 4
Cited 6

A priori optimization

Operations Research
A survey of approximately optimal solutions to some covering and packing problems

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Graphs and Hypergraphs

On the probabilistic minimum coloring and minimum k-coloring

Discrete Applied Mathematics
Vertex-Uncertainty in Graph-Problems

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the probabilistic minimum coloring and minimum k-coloring

Discrete Applied Mathematics
Steiner forests on stochastic metric graphs

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Probabilistic coloring of bipartite and split graphs

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
On the probabilistic min spanning tree Problem

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

We first propose a formal definition for the concept of probabilistic combinatorial optimization problem (under the a priori method). Next, we study the complexity of optimally solving probabilistic maximum independent set problem under several a priori optimization strategies as well as the complexity of approximating optimal solutions. For the different strategies studied, we present results about the restriction of probabilistic independent set on bipartite graphs.