The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex\nweights asks for a set of pairwise nonadjacent vertices of maximum total\nweight. Being one of the most investigated and most important problems on\ngraphs, it is well known to be NP-complete and hard to approximate....
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results using the Local Weak Convergence Method,” Random Structures and ... D Gamarnik,T Nowicki,G Swirszcz - John Wiley & Sons, Inc. 被引量: 122发表: 2004年 The Complexity of Counting in Sparse, Regular, and ...
Given a graph $G$, a non-negative integer $k$, and a weight function that maps each vertex in $G$ to a positive real number, the \emph{Maximum Weighted Budgeted Independent Set (MWBIS) problem} is about finding a maximum weighted independent set in $G$ of cardinality at most $k$....
Given a graph $G$, a non-negative integer $k$, and a weight function that maps each vertex in $G$ to a positive real number, the \emph{Maximum Weighted Budgeted Independent Set (MWBIS) problem} is about finding a maximum weighted independent set in $G$ of cardinality at most $k$....
Pal, T.K. Pal, An efficient PRAM algorithm for maximum-weight independent set on permutation graphs, Journal of Applied Mathematics & Computing 19 (2005) 77-92.Saha, A., Pal, M. and Pal, T. K., An efficient pram algorithm for maximum-weight inde- pendent set on permutation graphs, ...
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing the parameters appropriately in the problem Hamiltonian ...
In this paper, we consider three simple and natural greedy algorithms for the maximum weighted independent set problem. We show that two of them output an independent set of weight at least ∑v∈V(G)W(v)/[d(v)+1] and the third algorithm outputs an independent set of weight at least ...
A New Local Maximum Weight Independent Set Spectrum Allocation Algorithm Based on Historical Information for Dynamic Spectrum Allocation in Cognitive Radio Network 来自 知网 喜欢 0 阅读量: 63 作者:H Wan,XZ Xie,MA Bin,C Gao 摘要: A new algorithm based on historical information and local maximum ...
The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; it is well known to be NP-complete, and...
A closely related problem to the maximum independent set is the maximum weighted independent set. Sakai et al. [29] presented three greedy algorithms that find a weighted set that fulfills, at least, a certain weight. Some researchers have studied this problem under restricted graph topologies [...