Results 251 to 260 of about 17,985 (261)
Some of the next articles are maybe not open access.
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences, 2006Aravind Srinivasan +2 more
exaly
Iterative improvement of vertex covers
Information Processing Letters, 1995openaire +2 more sources
A better approximation ratio for the vertex cover problem
ACM Transactions on Algorithms, 2009George Karakostas
exaly
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
Theoretical Computer Science, 2017Mingyu Xiao
exaly
Test-cost-sensitive rough set based approach for minimum weight vertex cover problem
Applied Soft Computing Journal, 2018Xiaojun Xie +2 more
exaly
On the k-path vertex cover of some graph products
Discrete Mathematics, 2013Andrej Taranenko, Marko Jakovac
exaly
Vertex cover might be hard to approximate to within
Journal of Computer and System Sciences, 2008exaly
The vertex cover problem in cubic graphs
Information Processing Letters, 2013Jianhua Tu, Fengmei Yang
exaly
The k-path vertex cover of rooted product graphs
Discrete Applied Mathematics, 2015Marko Jakovac
exaly