Back to Results
First PageMeta Content



Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†
Add to Reading List

Document Date: 2011-07-21 06:07:45


Open Document

File Size: 156,87 KB

Share Result on Facebook

Company

Vertex / /

/

Facility

University of Bonn / /

IndustryTerm

proposed approximation algorithm / k-approximation algorithm / approximation algorithm / polynomial time approximation algorithm / approximate solution / /

Organization

Hausdorff Center for Mathematics / Hausdorff Center / University of Bonn / /

Person

Marek Karpinski∗ Richard Schmied / Richard Schmied† Claus Viehmann / /

Position

vp / /

Product

Sk / /

Technology

4 Approximation Algorithm / proposed approximation algorithm / k-approximation algorithm / polynomial time approximation algorithm / approximation algorithm / /

SocialTag