max k-vertex cover problem
Efficient algorithms for the Max k-Vertex Cover problem
... the max k-vertex cover problem a graph G(V, E) with |V | = n vertices 1, ...value k < n. The goal is to find a subset K ⊂ V with cardinality k, that is |K| ...
14
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
... the max k-vertex cover problem in bipartite graphs and propose a purely com- binatorial algorithm that beats the only such known algorithm, namely the greedy ...
14
Reoptimization of the Maximum Weighted Pk-Free Subgraph Problem under Vertex Insertion
... the max weighted independent set prob- lem, as well as min weighted vertex cover and min weighted set cover problems, are discussed in a similar setting up to the fact that perturbations there ...
12
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... given problem cannot be approximated within a certain approximation level (for instance, within a constant approximation ratio) unless a very unlikely complexity condition ...
26
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 added. Thus, Branch-and-Cut- and-Price algorithms is developed for these ...
232
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
... constant-size vertex set that hits all maximum-length necklace minor models, and whose removal therefore strictly decreases the maximum length of a necklace ...
20
Influence of the tie-break rule on the end-vertex problem
... last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker ...Corneil, K¨ohler and Lanlignel ...next vertex to be ...a problem ...
17
Improved Approximation Algorithms for the Max-Edge Coloring Problem
... MEC problem concern the existence of an approximation algorithm of ratio 2 − δ, for any constant δ > 0, for general or bipartite graphs, and the complexity of the problem on ...MEC problem on ...
12
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings
... cyclic cover gives a solution for the problems of Maximal Com- pression or of Shortest Cyclic Cover of Strings, ...Salesman Problem (Max-ATSP) and Maximal Compression on one hand, as well as ...
15
On computing the minimum 3-path vertex cover and dissociation number of graphs
... First, recall that for a case when ∆(G) ≤ 2, a simple linear-time algorithm can be used to solve this problem; we omit the details. We denote such an algorithm by E3PVC 2 (G, X). Our algorithm E3PVC for a general ...
14
The k-simultaneous consensus problem
... the k-simultaneous consensus ...The k-set agreement problem and the k-simultaneous binary consensus problem are wait-free equivalent in asynchronous read/write shared memory systems ...
18
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
... problems Vertex Cover and Inde- pendent ...a vertex set U ⊆ V , it is asked if there exists a minimal vertex cover ...classical problem can be solved in polynomial ...
21
An auction algorithm for the max-flow problem
... The iteration tries to construct an augmenting path starting at nl by using the second path construction algorithm of the preceding section, applied to the reduced graph[r] ...
33
The Max k-Cut Game and Its Strong Equilibria
... the max k−cut game is an edge weighted graph. Every vertex is controlled by an autonomous agent with strategy space ...the max k−cut game under two perspectives: existence and worst ...
12
A new efficient RLF-like algorithm for the vertex coloring problem
... The most popular fast heuristics for the VCP are based on greedy constructive procedures. These algorithms sequentially color the vertices following some rule for choosing the next vertex to color and the color to ...
17
The K ‐partitioning problem: Formulations and branch‐and‐cut
... clustering problem in which the size and the number of clusters are not ...the problem and present a cutting plane ...titioning problem in which each cluster must correspond to a ...
41
The K-moment problem for continuous linear functionals
... Since then, recent contributions have tried to better understand (in even a more general framework) the links between Psd(K) and closures (and sequential closures) of preorderings and quadratic modules, one ...
20
Global Optimization of the Maximum K-Cut Problem
... maximum k-cut problem that consists in partitioning the vertex set of a graph into k subsets such that the sum of the weights of edges joining vertices in different subsets is ...for k ...
109
Tight Bounds on Vertex Connectivity Under Vertex Sampling
... The New Approach. In this paper, we provide a completely new approach for analyzing the remaining vertex connectiv- ity after vertex sampling. Instead of sampling with proba- bility 1/ √ k in each ...
14
On-line algorithm for the minimal b-clique cover problem in interval graphs
... b-clique cover in interval ...on-line problem as a game between two ...minimization problem, the adversary is charged the minimum (off-line) cost to perform any request sequence it ...minimization ...
8