发布求助
文献互助 智能选刊 最新文献

Computing: The Australasian Theory Symposium最新文献

筛选
英文 中文
On-demand Bounded Broadcast Scheduling with Tight Deadlines 按需有界广播调度与紧迫的最后期限
Computing: The Australasian Theory Symposium Pub Date : 2007-04-01 DOI: 10.1142/S012905410700467X
C. Poon, Feifeng Zheng, Yinfeng Xu
{"title":"On-demand Bounded Broadcast Scheduling with Tight Deadlines","authors":"C. Poon, Feifeng Zheng, Yinfeng Xu","doi":"10.1142/S012905410700467X","DOIUrl":"https://doi.org/10.1142/S012905410700467X","url":null,"abstract":"We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. \u0000 \u0000The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modified algorithm, VAR, which is optimal for this case.","PeriodicalId":184964,"journal":{"name":"Computing: The Australasian Theory Symposium","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129497387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
On the Approximability of Maximum and Minimum Edge Clique Partition Problems 最大和最小边团划分问题的逼近性
Computing: The Australasian Theory Symposium Pub Date : 2006-01-16 DOI: 10.1142/S0129054107004656
Anders Dessmark, J. Jansson, A. Lingas, E. Lundell, Mia Persson
{"title":"On the Approximability of Maximum and Minimum Edge Clique Partition Problems","authors":"Anders Dessmark, J. Jansson, A. Lingas, E. Lundell, Mia Persson","doi":"10.1142/S0129054107004656","DOIUrl":"https://doi.org/10.1142/S0129054107004656","url":null,"abstract":"We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number of edges within the clusters is maximized (Max-ECP), or the number of edges between clusters is minimized (Min-ECP). These problems arise naturally in the DNA clone classification. We investigate the hardness of finding such partitions and provide approximation algorithms. Further, we show that greedy strategies yield constant factor approximations for graph classes for which maximum cliques can be found efficiently.","PeriodicalId":184964,"journal":{"name":"Computing: The Australasian Theory Symposium","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121793912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信