A Combinatorial Algorithm to Find a Maximum Even Factor

Author(s):  
Gyula Pap
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.


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

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

2007 ◽  
Vol 115 (2) ◽  
pp. 223-237 ◽  
Author(s):  
Kenjiro Takazawa
Keyword(s):  

2018 ◽  
Vol 196 ◽  
pp. 03017
Author(s):  
Jana Ižvoltová ◽  
Peter Pisca

Gauss-jacobi combinatorial algorithm is an alternative approach to traditional iterative numerical methods, which is primary oriented for parameter estimation in nonlinear models. The combinatorial algorithm is often exploited for outlier diagnosis in nonlinear models, where the other parameter estimation methods lose their efficiency. The paper describes comparison of both of gauss-jacobi combinatorial and gauss-markov models executed on parameter estimation process of levelling network for the reason to find the efficiency of combinatorial algorithm in simply linear model.


Sign in / Sign up

Export Citation Format

Share Document