Back to Results
First PageMeta Content
Comparability graph / Perfect graph / Clique / Independent set / Graph coloring / Trivially perfect graph / Path decomposition / Graph theory / NP-complete problems / Chordal graph


Approximation Algorithms for Finding Maximum Independent Sets in Unions of Perfect Graphs Authors: Chakaravarthy, Pandit, Roy, Sabharwal Speaker: Arindam Pal Department of Computer Science and Engineering Indian Institut
Add to Reading List

Document Date: 2012-12-01 01:44:16


Open Document

File Size: 300,37 KB

Share Result on Facebook

Company

The Common Independent Set Problem LP / V This LP / /

Facility

Engineering Indian Institute of Technology Delhi November / /

IndustryTerm

feasible solution / approximation algorithm / fractional solution / /

Organization

Arindam Pal Department of Computer Science / Computer Science and Engineering Indian Institute of Technology Delhi / /

Position

Sabharwal Speaker / /

Technology

approximation algorithm / Approximation Algorithms / /

SocialTag