Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 12 of 19 found articles
 
 
  Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs
 
 
Title: Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs
Author: Karpinski, Marek
Schmied, Richard
Viehmann, Claus
Appeared in: Journal of discrete algorithms
Paging: Volume 33 (2015) nr. C pages 9 p.
Year: 2015
Contents:
Publisher: Published by Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 12 of 19 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands