Refined algorithms for hitting many intervals

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Opening Hours
Collections
Help Via Email

Electronic Information Resources

Refined algorithms for hitting many intervals

详细信息查看全文

作者：Peter Damaschke ; ^{ptr@chalmers.se" class="auth_mail" title="E-mail the corresponding author}
关键词：Analysis of algorithms ; Scheduling with gaps ; Hitting set ; Interval graph ; Dynamic programming
刊名：Information Processing Letters
出版年：2017
出版时间：February 2017
年：2017
卷：118
期：Complete
页码：117-122
全文大小：273 K

文摘

•: Partial hitting sets in interval families are of interest for scheduling with gaps.
•: Optimal partial hitting sets can be computed faster in sparse interval graphs.
•: Different dynamic programming algorithms are tailored to different input parameters.

NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.