A priori optimization for the probabilistic maximum independent set problem

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 561-590

  Murat, Cécile ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Independent set; NP hard problem; Polynomial approximation; Probabilistic optimization

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILISTIC LOGICS; SET THEORY;

PROBABILISTIC COMBINATORIAL OPTIMIZATIONS;

COMBINATORIAL MATHEMATICS;

EID: 0037028434     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00005-6     Document Type: Article

References (16)

1. A priori optimization
2. Node-weighted graphs having the König-Egervary property
3. A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
4. 1-ε
5. Shortest path problems with node failures
6. A survey about how optimal solutions to some covering and packing problems can be approximated
7. On an extremal problem in graph theory