scholarly journals A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges

2021 ◽  
pp. 106146
Author(s):  
Katarzyna Paluch ◽  
Mateusz Wasylkiewicz
Author(s):  
A. Akbari ◽  
S. Akbari ◽  
A. Doosthosseini ◽  
Z. Hadizadeh ◽  
Michael A. Henning ◽  
...  

Author(s):  
Davide Mattiolo ◽  
Giuseppe Mazzuoccolo
Keyword(s):  

2018 ◽  
Vol 52 (1) ◽  
pp. 305-314 ◽  
Author(s):  
Vangelis Th. Paschos

We propose and analyze a simple purely combinatorial algorithm for max k-vertex cover in bipartite graphs, achieving approximation ratio 0.7. The only combinatorial algorithm currently known until now for this problem is the natural greedy algorithm, that achieves ratio (e − 1)/e = 0.632.


2011 ◽  
Vol 38 ◽  
pp. 463-468
Author(s):  
Hervé Hocquard ◽  
Pascal Ochem ◽  
Petru Valicov

1946 ◽  
Vol s1-21 (3) ◽  
pp. 219-226 ◽  
Author(s):  
Thomas E. Easterfield

2017 ◽  
Vol 61 ◽  
pp. 835-839
Author(s):  
Borut Lužar ◽  
Martina Mockovčiaková ◽  
Roman Soták

1979 ◽  
Vol 319 (1 Second Intern) ◽  
pp. 508-511
Author(s):  
Peter H. Sellers

2016 ◽  
Vol 339 (6) ◽  
pp. 1724-1726 ◽  
Author(s):  
Xin Zhang

Sign in / Sign up

Export Citation Format

Share Document