Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs

Authors:
  • JBJonathan Backer
    Jonathan Backer
  • JKJ. Mark Keil
    J. Mark Keil

Abstract
No abstract available
Funding Information
  • Natural Sciences and Engineering Research Council of Canada
  • Natural Sciences and Engineering Research Council of Canada