Back to Results
First PageMeta Content
Combinatorics / Matroid theory / Combinatorial optimization / Set cover problem / Matroid / Feedback vertex set / Maximum cut / Greedy algorithm / Mathematics / Theoretical computer science / NP-complete problems


Implicit Hitting Set Problems, Multi-Genome Alignment and Colorful Connected Subgraphs Richard M. Karp CPM New York, June, 2010
Add to Reading List

Document Date: 2010-08-20 17:45:40

Open Document

File Size: 216,75 KB

Share Result on Facebook

IndustryTerm

practice greedy algorithm / implicit hitting set algorithm / branch-and-cut algorithm / good approximate solutions / /

Person

Richard M. Karp / /

Technology

Implicit Hitting Set Algorithm / practice greedy algorithm / branch-and-cut algorithm / /

SocialTag