• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs

Thumbnail
Date
2018
Dewey
Programmation, logiciels, organisation des données
Sujet
Approximation algorithms; Combinatorial algorithms; Non linear program; Graph algorithms; Maximum coverage
Journal issue
Discrete Optimization
Volume
27
Publication date
02-2018
Article pages
26-56
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.disopt.2017.09.001
URI
https://basepub.dauphine.fr/handle/123456789/20955
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Bonnet, Edouard
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Escoffier, Bruno
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paschos, Vangelis
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Stamoulis, Georgios
Type
Article accepté pour publication ou publié
Abstract (EN)
We study the polynomial time approximation of the NP-hard max -vertex cover problem in bipartite graphs and propose purely combinatorial approximation algorithms. The main result of the paper is a simple combinatorial algorithm and a computer-assisted analysis of its approximation guarantee giving strong evidence that the worst approximation ratio achieved is bounded below by 0.821.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.