The Probabilistic Minimum Vertex-covering Problem

DOI10.1111/1475-3995.00338MaRDI QIDQ4532541zbMATH OpenOpenAlexFDO

Authors C. Murat, Vangelis Th. Paschos

Publication date 10 October 2002

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://basepub.dauphine.fr/handle/123456789/2934

zbMATH Keywords

a priori optimizationprobabilistic vertex-covering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic models in economics (91B70)

Recommendations

• The probabilistic minimum dominating set problem
• The probabilistic min dominating set problem
• The minimum generalized vertex cover problem
• Algorithms - ESA 2003
• The probabilistic minimum spanning tree problem
• On the max min vertex cover problem
• On the max min vertex cover problem
• The Probabilistic Set-Covering Problem
• On the probabilistic min spanning tree problem
• Probabilistic algorithm for minimum \(k\)-fold dominating set problem

Cited in

(13)

• Vertex-Uncertainty in Graph-Problems
• A survey on combinatorial optimization in dynamic environments
• Probabilistic models for the Steiner tree problem
• Minimum vertex cover in generalized random graphs with power law degree distribution
• Probabilistic graph-coloring in bipartite and split graphs
• A priori optimization for the probabilistic maximum independent set problem
• The minimum likely column cover problem
• On the chance-constrained minimum spanning \(k\)-core problem
• A decomposition strategy for the vertex cover problem
• The probabilistic minimum dominating set problem
• On the probabilistic minimum coloring and minimum k-coloring
• On the probabilistic min spanning tree problem
• Probabilistic optimization in graph-problems

This page was built for publication: The Probabilistic Minimum Vertex-covering Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532541)