Login / Signup

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time.

Manuel CáceresMassimo CairoBrendan MumeyRomeo RizziAlexandru I. Tomescu
Published in: SODA (2022)
Keyphrases
  • minimum length
  • minimum cost
  • shortest path
  • compressed sensing
  • endpoints
  • global minimum
  • simple polygon
  • hidden markov models
  • worst case
  • information retrieval
  • case study