Make it Practical: A Generic Linear-Time Algorithm for Solving Maximum-Weightsum Problems (2000)

Cached

Download Links

by Isao Sasano , Zhenjiang Hu , Masato Takeichi , Mizuhito Ogawa
Venue:In Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00
Citations:12 - 8 self

Active Bibliography

1 Calculating linear time algorithms for solving maximum weightsum problems – Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa - 2001
1 Generation of Efficient Algorithms for Maximum Marking Problems – Isao Sasano
1 Generation of Efficient Programs for Solving Maximum Multi-Marking Problems – Isao Sasano, Zhenjiang Hu, Masato Takeichi - 2001
40 Algorithms For Vertex Partitioning Problems On Partial k-Trees – Jan Arne Telle, andrzej Proskurowski - 1997
18 Combinatorial Optimization on Graphs of Bounded Treewidth – Hans L. Bodlaender, Arie M. C. A. Koster - 2007
2 Solving Problems on Recursively Constructed Graphs – Richard B. Borie, R. Gary Parker, Craig A. Tovey
2 Towards polytypic parallel programming – Zhenjiang Hu, Masato Takeichi, Hideya Iwasaki - 1998
16 Calculating Accumulations – Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi - 1999
6 Reduction Algorithms for Graphs with Small Treewidth – Hans L. Bodlaender, Babette De Fluiter - 1995
6 The maximum subforest problem: Approximation and exact algorithms – Ron Shamir , Dekel Tsur - 1998
49 Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs – Hans L. Bodlaender, Ton Kloks - 1993
18 Width parameters beyond tree-width and their applications – Petr HlinÄ›ny, Sang-il Oum, Detlef Seese, Georg Gottlob - 2007
5 Functional polytypic programming | use and implementation – Patrik Jansson - 1997
4 Program Transformation in Calculational Form – Akihiko Takano, Zhenjiang Hu, Masato Takeichi - 1998
16 Branch and Tree Decomposition Techniques for Discrete Optimization – Illya V. Hicks, Arie M. C. A. Koster, et al. - 2005
1 Tree-edges deletion problems with bounded diameter obstruction sets – Dekel Tsur
1 Width parameters beyond treewidth and their applications, The Computer Journal – Detlef Seese, Georg Gottlob
56 Beyond NP-Completeness for Problems of Bounded Width: Hardness for the W Hierarchy (Extended Abstract) – Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett - 1994
6 Parallel Algorithms for Series Parallel Graphs – Hans L. Bodlaender, Babette De Fluiter - 1996