External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis. A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. In Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, editors, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings. Volume 9644 of Lecture Notes in Computer Science, pages 235-248, Springer, 2016. [doi]

Authors

Édouard Bonnet

This author has not been identified. Look up 'Édouard Bonnet' in Google

Bruno Escoffier

This author has not been identified. Look up 'Bruno Escoffier' in Google

Vangelis Th. Paschos

This author has not been identified. Look up 'Vangelis Th. Paschos' in Google

Georgios Stamoulis

This author has not been identified. Look up 'Georgios Stamoulis' in Google
runs on