However, this fact does not obviate the need for solving these problems for their practical importance.; An outstanding example of such optimization problems is the well-known NP-hard problem Vertex Cover. This problem has numerous applications in fields like biochemistry, VLSI design, and ...
In this paper we study the capacitated vertex cover problem, a generalization of the well known vertex problem. Given a graph G = (V; E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of...
vertex covering by pathscombinatorial problemsmachine translationGiven a tree and a set of paths in the tree, the problem of finding a minimum number of paths from the given path set to cover all the vertices in the tree is investigated in the paper. To distinguish from the classical path ...
The latter illustrates some combinatorial optimization problems mapped on to neural networks including traveling salesman problem, graph partitioning problem, graph vertex cover problem, graph independent set problem,graph maximum clique problem, graph maximum matching problem, graph isomorphism problem, task ...
In this paper we investigate applications of the linear matroid parity algorithm to the Steiner tree problem for two classes of graphs: where the terminals form a vertex cover and where terminals form a dominating set. As all these problems are MAX-SNP-hard, the issue is what approximation ...
Minimum Submodular Cover problem often occurs naturally in the context of combinatorial optimization. It is well-known that the greedy algorithm achieves an H(δ)-approximation guarantee for an integer-valued polymatroid potential function f, where δ is the maximum value of f over all singletons ...
Graphs are extremely useful in modeling systems in physical sciences and engineering problems, because of their intuitive diagrammatic nature. This text gi... WK Chen - WORLD SCIENTIFIC 被引量: 187发表: 1997年 Analysis of population-based evolutionary algorithms for the vertex cover problem Recently...
The minimum vertex cover problem (MVCP) and minimum weighted vertex cover problem (MWVCP) have been used in a variety of applications. This paper focuses o... X Xiea,X Qina,C Yub,... - 《Applied Soft Computing》 被引量: 1发表: 2017年 Soft multi-rough set topology with applications ...
Ideally, the component generation step is open and flexible enough to cover the range of algorithms people use when creating vertex attributes and attribute maps. Automating the process as much as possible without sacrificing flexibility is the goal. Tangent creation often demands the mo...
The division rule: There are n/d ways to do a task if it can be done using a procedure that can be carried out in n ways, and for every way w, exactly d of the n ways correspond to way w. As in Example 20 in the textbook, page 394 in pdf. Counting problems can be solved ...