On the minimum weight bounded length circuit cover problem on grid graphs

Research output: Working paper

Abstract

This paper looks at the minimum weight bounded length circuit cover problem on rectangular grid graphs. We give a constructive procedure to determine an edge cover of the augemented Eulerian graph with circuits of fixed length.
Original languageEnglish
Publication statusUnpublished - 2013

Keywords

  • minimum weight
  • bounded length
  • circuit cover problem
  • grid graphs

Cite this