The Probabilistic Minimum Vertex-covering Problem
From MaRDI portal
Publication:4532541
DOI10.1111/1475-3995.00338zbMath0994.90122OpenAlexW2070206118MaRDI QIDQ4532541
Vangelis Th. Paschos, Cécile Murat
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
Related Items
A survey on combinatorial optimization in dynamic environments, The probabilistic minimum dominating set problem, On the probabilistic min spanning tree problem, On the probabilistic minimum coloring and minimum \(k\)-coloring, Probabilistic models for the Steiner Tree problem, A priori optimization for the probabilistic maximum independent set problem, Probabilistic graph-coloring in bipartite and split graphs, Vertex-Uncertainty in Graph-Problems