Approximation Algorithms for Maximum Two-Dimensional Pattern Matching

Download PDF
Open Webpage

Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe

Published: 1996, Last Modified: 21 Jan 2026CPM 1996EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We introduce the following optimization version of the classical pattern matching problem (referred to as the maximum pattern matching problem). Given a two-dimensional rectangular text and a 2-dimensional rectangular pattern find the maximum number of non-overlapping occurrences of the the pattern in the text.