Institutional Repository
| toward an automatic approach to greedy algorithms | |
Zheng Yujun; Xue Jinyun; Zuo Zhengkang
| |
| 2009 | |
| Conference Name | 3rd International Workshop on Frontiers in Algorithmics |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 302-313 |
| Conference Date | JUN 20-23, |
| Conference Place | Hefei, PEOPLES R CHINA |
| Indexed Type | istp,ei,acm |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | FRONTIERS IN ALGORITHMICS, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 978-3-642-02269-2 |
| Department | Zheng, Yujun; Xue, Jinyun; Zuo, Zhengkang Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. |
| English Abstract | The greedy approach is widely used for combinatorial optimization problems, but its implementation varies from problem to problem. In this paper we propose a mechanical approach for implementing greedy algorithmic programs. Using PAR, method, a problem can be continually partitioned into subproblems in smaller size based on the problem singleton and the maximum selector, and the greedy algorithm can be mechanically generated by combining the problem-solving sequences. Our structural model supports logical transformation from specifications to algorithmic programs by deductive inference; and thus significantly promotes the automation and reusability of algorithm design. |
| Keyword | Combinatorial Optimization Problems Par Method Problem Singleton Greedy Algorithm |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8342 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Zheng Yujun,Xue Jinyun,Zuo Zhengkang. toward an automatic approach to greedy algorithms[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:FRONTIERS IN ALGORITHMICS, PROCEEDINGS,2009:302-313. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment