{"componentChunkName":"component---src-pages-blog-minimum-substring-cover-problem-index-mdx","path":"/blog/minimum-substring-cover-problem/","result":{"pageContext":{"frontmatter":{"title":"Minimum substring cover problem","description":"","published":"2012-01-11T00:00:00.000Z","redirect_from":["/blog/minimum-substring-cover-problem/swizec/3406"],"categories":"Algorithm, Approximation algorithm, Combinatorics, Linear programming, Math, NP-hard, Substring, Uncategorized","hero":"../../../defaultHero.jpg"}}},"staticQueryHashes":["1171014969","1685367536","1895165123","1907957565","24089170","2612478234","2744905544","3352443759","3908013554","393808075"]}