## Generation of Efficient Algorithms for Maximum Marking Problems

Citations: | 1 - 0 self |

### BibTeX

@MISC{Sasano_generationof,

author = {Isao Sasano},

title = {Generation of Efficient Algorithms for Maximum Marking Problems},

year = {}

}

### OpenURL

### Abstract

In existing work on graph algorithms, it is known that a linear time algorithm can be derived mechanically from a logical formula for a class of optimization problems. But this has a serious problem that the derived algorithm has huge constant factor. In this work, we redene this problem on recursive data structures as a maximum marking problem and propose method for deriving a linear time algorithm for that. In this method, speci cation is given using recursive functions instead of logical formula, which results in a practical linear time algorithm. This method is mechanical and in fact, based on this deriving method, we make a system which automatically generates a practical linear time algorithm from specication for a maximum marking problem.