Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,004,598 papers from all fields of science
Search
Sign In
Create Free Account
Vertex cover
Known as:
Hitting set problem
, Vertex covering number
, Minimum cover
Expand
In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACM Transactions on Algorithms
APX
Approximation algorithm
Bidimensionality
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A Parallel Genetic Algorithm for Three Dimensional Bin Packing with Heterogeneous Bins
Drona Pratap Chandu
arXiv.org
2014
Corpus ID: 824659
This paper presents a parallel genetic algorithm for three dimensional bin packing with heterogeneous bins using Hadoop Map…
Expand
2013
2013
Minimum covering distance energy of a graph
M. Kanna
,
B. Dharmendra
,
R. P. Kumar
2013
Corpus ID: 18035131
Recently Prof.Chandrashekar Adiga et al.[1] have defined the minimum covering energy, EC(G) of a graph G which depends on its…
Expand
2012
2012
INDEPENDENT AND VERTEX COVERING NUMBER ON STRONG PRODUCT OF COMPLETE GRAPHS
C. Baitiang
,
T. Sitthiwirattham
2012
Corpus ID: 54835134
Let �(G) and �(G) be the independent number and vertex covering number, respectively. The strong Product G1 ⊠ G2 of graph of G1…
Expand
2011
2011
Approximation Algorithm for Security Games with Costly Resources
Sayan Bhattacharya
,
Vincent Conitzer
,
Kamesh Munagala
Workshop on Internet and Network Economics
2011
Corpus ID: 7735571
In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains. These…
Expand
2008
2008
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
S. Laue
Symposium on Theoretical Aspects of Computer…
2008
Corpus ID: 130068
Suppose we are given a finite set of points $P$ in $R^3$ and a collection of polytopes $mathcal{T}$ that are all translates of…
Expand
2008
2008
Mining Functional Dependency from Relational Databases Using Equivalent Classes and Minimal Cover
J. Atoum
,
Dojanah Bader
,
A. Awajan
2008
Corpus ID: 9433210
Data Mining (DM) represents the process of extracting interesting and previously unknown knowledge from data. This study proposes…
Expand
2001
2001
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs
Oded Goldreich
Studies in Complexity and Cryptography
2001
Corpus ID: 7506892
Using known results regarding PCP, we present simple proofs of the inapproximability of vertex cover for hypergraphs…
Expand
1994
1994
Elimination of inference channels by optimal upgrading
M. Stickel
Proceedings of IEEE Computer Society Symposium…
1994
Corpus ID: 24597708
An inference channel exists if it is possible for a low-clearance user to infer high-classification data from low-classification…
Expand
1993
1993
Facets for the Multiple Knapsack ProblemC
E. Ferreira
1993
Corpus ID: 12525695
In this paper we consider the multiple knapsack problem which is deened as follows: given a set N of items with weights f i , i 2…
Expand
1992
1992
Repair of RAMs with clustered faults
B. Vinnakota
,
J. Andrews
Proceedings IEEE International Conference on…
1992
Corpus ID: 38310030
A graph-theoretic formulation for memory repair in the presence of clustered faults is presented. This approach is based on the…
Expand