| 题名: | toward an automatic approach to greedy algorithms |
| 作者: | Zheng Yujun
; Xue Jinyun
; Zuo Zhengkang
|
| 会议文集: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| 会议名称: | 3rd International Workshop on Frontiers in Algorithmics
|
| 会议日期: | JUN 20-23,
|
| 出版日期: | 2009
|
| 会议地点: | Hefei, PEOPLES R CHINA
|
| 关键词: | Combinatorial optimization problems
; PAR method
; problem singleton
; greedy algorithm
|
| 出版者: | FRONTIERS IN ALGORITHMICS, PROCEEDINGS
|
| 出版地: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| 收录类别: | istp,ei,acm
|
| ISSN: | 0302-9743
|
| ISBN: | 978-3-642-02269-2
|
| 部门归属: | Zheng, Yujun; Xue, Jinyun; Zuo, Zhengkang Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
|
| 英文摘要: | 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. |
| 语种: | 英语
|
| 内容类型: | 会议论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/8342
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
|
There are no files associated with this item.
|
| Recommended Citation: | |
Zheng Yujun,Xue Jinyun,Zuo Zhengkang. toward an automatic approach to greedy algorithms[C]. 见:3rd International Workshop on Frontiers in Algorithmics. Hefei, PEOPLES R CHINA. JUN 20-23,.
|
|
|
