Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP-hard
problem with important applications. There has been much interest in develo** heuristic …

Abstract The Maximum Weight Clique problem (MWCP) is an important generalization of the
Maximum Clique problem with wide applications. This paper introduces two heuristics and …

The maximum weight clique problem (MWCP) is an important generalization of the
maximum clique problem with wide applications. In this study, we develop two efficient local …

The minimum independent dominance set (MIDS) problem is an important version of the
dominating set with some other applications. In this work, we present an improved master …

This paper presents and analyzes two new efficient local search strategies for the Boolean
Satisfiability (SAT) problem. We start by proposing a local search strategy called …

Grou** problems aim to partition a set of items into multiple mutually disjoint subsets
according to some specific criterion and constraints. Grou** problems cover a large class …

Weighted maximum satisfiability and (unweighted) partial maximum satisfiability (PMS) are
two significant generalizations of maximum satisfiability (MAX-SAT), and weighted partial …

Virtual machine (VM) provisioning is a common and critical problem in cloud computing. In
industrial cloud platforms, there are a huge number of VMs provisioned per day. Due to the …

The minimum weight dominating set (MWDS) problem is an important generalization of the
minimum dominating set problem with various applications. In this work, we develop an …