[PDF] Top 20 Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Has 10000 "Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs" found on our website. Below are the top 20 most common "Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs".
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
... contribution In this article, we mainly deal with complexity and approximability issues for MinCVC in particular classes of ...on connected vertex covers (Section ... Voir le document complet
22
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
... vertices in S i ∪ X i is at least the average degree of vertices in O i \ (S i ∪ X i ); finally, for the last two inequalities the sum of degrees of the k i − k i ... Voir le document complet
14
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
... if the given vertex-colored graph is a tree, but fixed-parameter tractable in this case when parameterized by the size of the given motif ...when the vertex- colored graph ... Voir le document complet
12
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
... studied in numerous problems. In a recent serie of papers [KLM13a, KLM13b, KMMN15, LM14, LM15], authors deal with conflicts between pairs of edges, in problems such as finding a path, spanning tree, ... Voir le document complet
16
Approximation algorithms via structural results for apex-minor-free graphs
... obtained for the more general family of graphs excluding any fixed minor H ...elusive for this general situation. The challenge of an improved approximation for ... Voir le document complet
13
Efficient algorithms for the Max k-Vertex Cover problem
... For Corollary 3, just observe that the running-times claimed for the first two entries are those needed to optimally solve max λk-vertex cover (the former due to [8] ... Voir le document complet
14
Parameterized Power Vertex Cover
... of the most studied problems in FPT algorithms, and the complexity of the fastest algorithm as a function of k has led to a long “race” of improving results, see ... Voir le document complet
18
The Robust Set Problem: Parameterized Complexity and Approximation
... study in this paper the parameterized complexity of k-Robust Set and the approximation of the associated maximization ...When the parameter is k, we show that this ... Voir le document complet
12
Weighted coloring on planar, bipartite and split graphs: complexity and approximation
... study complexity and approximation of MIN WEIGHTED NODE COLORING in planar, bipartite and split ...this problem is NP-complete in planar graphs, even if they are ... Voir le document complet
25
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... . In Section 4 we develop moderately exponential approximation algorithms for another paradigmatic problem in combinatorial optimization, the min vertex cover .... ... Voir le document complet
26
Parameterized complexity and approximation issues for the colorful components problems
... combinatorial problem formulations, based on different objective functions, have been proposed and studied in this direction [6, ...(MCC) and Maximum Edges in transitive Closure (MEC). ... Voir le document complet
15
The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms
... isolating-separator and the terminal-pair-separator formulations use y variables, several valid inequalities presented in Chapter 2 can then be ...Branch-and-Cut- and-Price algorithms ... Voir le document complet
232
Maximum Motif Problem in Vertex-Colored Graphs
... M in G that results in as few connected components as ...This problem was referred as ...even in the extremal case where the motif is a set and the ... Voir le document complet
16
On computing the minimum 3-path vertex cover and dissociation number of graphs
... Conclusion In this paper, we presented a moderately exponential-time exact algorithm and approxi- mation algorithms for the minimum 3-path vertex ...expected approximation ratio ... Voir le document complet
14
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
... of the classical graph problems Vertex Cover and Inde- pendent ...E) and a vertex set U ⊆ V , it is asked if there exists a minimal vertex cover ...even in ... Voir le document complet
21
Differential approximation results for the traveling salesman problem with distances 1 and 2
... (NPO) problem Π and a polynomial time approx- imation algorithm A feasibly solving Π, we will denote by ω(I), λ A (I) and β(I) the values of the worst solution of I, of the ... Voir le document complet
12
Parameterized and approximation complexity of the detection pair problem in graphs
... is the input size, and c is a constant. In this paper we will always consider the solution size k as the ...to the books [8, 23] for more details. Finbow, Hartnell ... Voir le document complet
13
Upper Domination : Complexity and Approximation
... solution and then gradually tries to improve it in an obvious way until it gets ...stuck. For example, one can produce a (maximal) independent set of a graph by starting with a single vertex ... Voir le document complet
17
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities
... that the instance cannot be loaded into the memory of the processing unit (see hypothesis ...above). The constraint C 3 comes from the fact that in many cases, the ... Voir le document complet
19
Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination
... formally, the notions of complexity that will be needed in the ...refer the reader to, e.g., [1], [8], [18] or [22] for more on this ...decision problem is of the ... Voir le document complet
25
Sujets connexes