The Probabilistic Minimum Vertex-covering Problem
نویسندگان
چکیده
منابع مشابه
The Probabilistic Minimum Coloring Problem
Nous étudions le problème de coloration probabiliste (PCOLOR) sous une stratégie de modification consistant, pour une solution a priori C, de supprimer les sommets qui son absents de C. Nous calculons la fonction objectif associée avec cette stratégie, donnons des bornes pour sa valeur et caractérisons la complexité algorithmique du calcul de la solution a priori optimal. Nous démontrons que PC...
متن کاملThe probabilistic minimum spanning tree problem
In this paper we consider a natural probabilistic variation of the classical minimum spanning tree problem (MST), which we call the probabilistic minimum spanning tree problem (PMST). In particular, we consider the case where not all the points are deterministically present, but are present with certain probability. We discuss the applications of the PMST and find a closed-form expression for t...
متن کاملThe Probabilistic Minimum Coloring Problem (Preliminary version)
Nous étudions le problème de coloration probabiliste (PCOLOR) sous une stratégie de modification consistant, pour une solution a priori C , de supprimer les sommets qui son absents de C . Nous calculons la fonction objectif associée avec cette stratégie, donnons des bornes pour sa valeur et caractérisons la complexité algorithmique du calcul de la solution a priori optimal. Nous démontrons que ...
متن کاملA New Solver for the Minimum Weighted Vertex Cover Problem
Given a vertex-weighted graph G = 〈V,E〉, the minimum weighted vertex cover (MWVC) problem is to choose a subset of vertices with minimum total weight such that every edge in the graph has at least one of its endpoints chosen. While there are good solvers for the unweighted version of this NP-hard problem, the weighted version—i.e., the MWVC problem—remains understudied despite its common occurr...
متن کاملCrown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. ([20], [1]). We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so called strong crown reductions, suitable for find...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2002
ISSN: 0969-6016,1475-3995
DOI: 10.1111/1475-3995.00338