### Abstract

In this paper we propose a new method for deriving a practical linear-time algorithm from the specification of a maximum-weightsum problem: From the elements of a data structure x, find a subset which satisfies a certain property p and whose weightsum is maximum. Previously proposed methods for automatically generating linear-time algorithms are theoretically appealing, but the algorithms generated are hardly useful in practice due to a huge constant factor for space and time. The key points of our approach are to express the property p by a recursive boolean function over the structure x rather than a usual logical predicate and to apply program transformation techniques to reduce the constant factor. We present an optimization theorem, give a calculational strategy for applying the theorem, and demonstrate the effectiveness of our approach through several nontrivial examples which would be difficult to deal with when using the methods previously available.

Original language | English |
---|---|

Title of host publication | Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP |

Place of Publication | New York, NY, United States |

Publisher | ACM |

Pages | 137-149 |

Number of pages | 13 |

Publication status | Published - 2000 |

Externally published | Yes |

Event | 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00) - Montreal, Que, Can Duration: 2000 Sep 18 → 2000 Sep 21 |

### Other

Other | 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00) |
---|---|

City | Montreal, Que, Can |

Period | 00/9/18 → 00/9/21 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP*(pp. 137-149). New York, NY, United States: ACM.

**Make it practical : A generic linear-time algorithm for solving maximum-weightsum problems.** / Sasano, Isao; Hu, Zhenjiang; Takeichi, Masato; Ogawa, Mizuhito.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP.*ACM, New York, NY, United States, pp. 137-149, 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00), Montreal, Que, Can, 00/9/18.

}

TY - GEN

T1 - Make it practical

T2 - A generic linear-time algorithm for solving maximum-weightsum problems

AU - Sasano, Isao

AU - Hu, Zhenjiang

AU - Takeichi, Masato

AU - Ogawa, Mizuhito

PY - 2000

Y1 - 2000

N2 - In this paper we propose a new method for deriving a practical linear-time algorithm from the specification of a maximum-weightsum problem: From the elements of a data structure x, find a subset which satisfies a certain property p and whose weightsum is maximum. Previously proposed methods for automatically generating linear-time algorithms are theoretically appealing, but the algorithms generated are hardly useful in practice due to a huge constant factor for space and time. The key points of our approach are to express the property p by a recursive boolean function over the structure x rather than a usual logical predicate and to apply program transformation techniques to reduce the constant factor. We present an optimization theorem, give a calculational strategy for applying the theorem, and demonstrate the effectiveness of our approach through several nontrivial examples which would be difficult to deal with when using the methods previously available.

AB - In this paper we propose a new method for deriving a practical linear-time algorithm from the specification of a maximum-weightsum problem: From the elements of a data structure x, find a subset which satisfies a certain property p and whose weightsum is maximum. Previously proposed methods for automatically generating linear-time algorithms are theoretically appealing, but the algorithms generated are hardly useful in practice due to a huge constant factor for space and time. The key points of our approach are to express the property p by a recursive boolean function over the structure x rather than a usual logical predicate and to apply program transformation techniques to reduce the constant factor. We present an optimization theorem, give a calculational strategy for applying the theorem, and demonstrate the effectiveness of our approach through several nontrivial examples which would be difficult to deal with when using the methods previously available.

UR - http://www.scopus.com/inward/record.url?scp=0034545063&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034545063&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034545063

SP - 137

EP - 149

BT - Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

PB - ACM

CY - New York, NY, United States

ER -