oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Harnessing Genetic Algorithm for Vertex Cover Problem  [PDF]
Harsh Bhasin,Geetanjli Ahuja
International Journal on Computer Science and Engineering , 2012,
Abstract: The problem of finding a minimum vertex cover is an NP hard optimization problem. Some approximation algorithms for the problem have been proposed but most of them are neither optimal nor complete. The work proposes the use of the theory of natural selection via Genetic Algorithms (GAs) for solving the problem. The proposed work has been tested for some constrained inputs and the results wereencouraging. The paper also discusses the application of genetic algorithms to the solution and the requisite analysis. The approach presents a Genetic Algorithms based solution to a problem.
On minimum vertex cover of generalized Petersen graphs  [PDF]
Babak Behsaz,Pooya Hatami,Ebadollah S. Mahmoodian
Computer Science , 2010,
Abstract: For natural numbers $n$ and $k$ ($n > 2k$), a generalized Petersen graph $P(n,k)$, is defined by vertex set $\lbrace u_i,v_i\rbrace$ and edge set $\lbrace u_iu_{i+1},u_iv_i,v_iv_{i+k}\rbrace$; where $i = 1,2,\dots,n$ and subscripts are reduced modulo $n$. Here first, we characterize minimum vertex covers in generalized Petersen graphs. Second, we present a lower bound and some upper bounds for $\beta(P(n,k))$, the size of minimum vertex cover of $P(n,k)$. Third, in some cases, we determine the exact values of $\beta(P(n,k))$. Our conjecture is that $\beta(P(n,k)) \le n + \lceil\frac{n}{5}\rceil$, for all $n$ and $k$.
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover  [PDF]
Samir Khuller,Uzi Vishkin,Neal Young
Computer Science , 2002, DOI: 10.1006/jagm.1994.1036
Abstract: The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing).
Squarefree vertex cover algebras  [PDF]
Shamila Bayati,Farhad Rahmati
Mathematics , 2011,
Abstract: In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are standard graded. In this context we exhibit a duality theorem for squarefree vertex cover algebras.
Online Vertex Cover and Matching: Beating the Greedy Algorithm  [PDF]
Yajun Wang,Sam Chiu-wai Wong
Computer Science , 2013,
Abstract: In this paper, we explicitly study the online vertex cover problem, which is a natural generalization of the well-studied ski-rental problem. In the online vertex cover problem, we are required to maintain a monotone vertex cover in a graph whose vertices arrive online. When a vertex arrives, all its incident edges to previously arrived vertices are revealed to the algorithm. For bipartite graphs with the left vertices offline (i.e. all of the left vertices arrive first before any right vertex), there are algorithms achieving the optimal competitive ratio of $\frac{1}{1-1/e}\approx 1.582$. Our first result is a new optimal water-filling algorithm for this case. One major ingredient of our result is a new charging-based analysis, which can be generalized to attack the online fractional vertex cover problem in general graphs. The main contribution of this paper is a 1.901-competitive algorithm for this problem. When the underlying graph is bipartite, our fractional solution can be rounded to an integral solution. In other words, we can obtain a vertex cover with expected size at most 1.901 of the optimal vertex cover in bipartite graphs. The next major result is a primal-dual analysis of our algorithm for the online fractional vertex cover problem in general graphs, which implies the dual result of a 0.526-competitive algorithm for online fractional matching in general graphs. Notice that both problems admit a well-known 2-competitive greedy algorithm. Our result in this paper is the first successful attempt to beat the greedy algorithm for these two problems. On the hardness side, we show that no randomized online algorithm can achieve a competitive ratio better than 1.753 and 0.625 for the online fractional vertex cover problem and the online fractional matching problem respectively, even for bipartite graphs.
Minimum Vertex Cover in Rectangle Graphs  [PDF]
Reuven Bar-Yehuda,Danny Hermelin,Dror Rawitz
Computer Science , 2010,
Abstract: We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of $(1.5 + \varepsilon)$ in general rectangle families, for any fixed $\varepsilon > 0$, and works also for the weighted variant of the problem. Both algorithms exploit the plane properties of axis-parallel rectangles in a non-trivial way.
Vertex Cover Reconfiguration and Beyond  [PDF]
Amer E. Mouawad,Naomi Nishimura,Venkatesh Raman
Computer Science , 2014,
Abstract: In the Vertex Cover Reconfiguration (VCR) problem, given graph $G = (V, E)$, positive integers $k$ and $\ell$, and two vertex covers $S$ and $T$ of $G$ of size at most $k$, we determine whether $S$ can be transformed into $T$ by a sequence of at most $\ell$ vertex additions or removals such that every operation results in a vertex cover of size at most $k$. Motivated by recent results establishing the W[1]-hardness of VCR when parameterized by $\ell$, we delineate the complexity of the problem restricted to various graph classes. In particular, we show that VCR remains W[1]-hard on bipartite graphs, is NP-hard but fixed-parameter tractable on graphs of bounded degree, and is solvable in time polynomial in $|V(G)|$ on cactus graphs. We prove W[1]-hardness and fixed-parameter tractability via two new problems of independent interest.
TREEWIDTH and PATHWIDTH parameterized by vertex cover  [PDF]
Mathieu Chapelle,Mathieu Liedloff,Ioan Todinca,Yngve Villanger
Computer Science , 2013,
Abstract: After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover. Here we consider the TREEWIDTH and PATHWIDTH problems parameterized by k, the size of a minimum vertex cover of the input graph. We show that the PATHWIDTH and TREEWIDTH can be computed in O*(3^k) time. This complements recent polynomial kernel results for TREEWIDTH and PATHWIDTH parameterized by the Vertex Cover.
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers  [PDF]
Archita Agarwal,Venkatesan T. Chakaravarthy,Anamitra R. Choudhury,Sambuddha Roy,Yogish Sabharwal
Computer Science , 2013,
Abstract: In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval cover and tree cover. We design unified distributed and parallel algorithms that can handle any set cover problem falling under the above framework and yield constant factor approximations. These algorithms run in polylogarithmic communication rounds in the distributed setting and are in NC, in the parallel setting.
The Price of Connectivity for Vertex Cover  [PDF]
Eglantine Camby,Jean Cardinal,Samuel Fiorini,Oliver Schaudt
Computer Science , 2013,
Abstract: The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover number. Connected vertex covers are found in many applications, and the relationship between those two graph invariants is therefore a natural question to investigate. For that purpose, we introduce the {\em Price of Connectivity}, defined as the ratio between the two vertex cover numbers. We prove that the price of connectivity is at most 2 for arbitrary graphs. We further consider graph classes in which the price of connectivity of every induced subgraph is bounded by some real number $t$. We obtain forbidden induced subgraph characterizations for every real value $t \leq 3/2$. We also investigate critical graphs for this property, namely, graphs whose price of connectivity is strictly greater than that of any proper induced subgraph. Those are the only graphs that can appear in a forbidden subgraph characterization for the hereditary property of having a price of connectivity at most $t$. In particular, we completely characterize the critical graphs that are also chordal. Finally, we also consider the question of computing the price of connectivity of a given graph. Unsurprisingly, the decision version of this question is NP-hard. In fact, we show that it is even complete for the class $\Theta_2^P = P^{NP[\log]}$, the class of decision problems that can be solved in polynomial time, provided we can make $O(\log n)$ queries to an NP-oracle. This paves the way for a thorough investigation of the complexity of problems involving ratios of graph invariants.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.