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

Combinatorics, Algorithms, Probabilistic and Experimental Methodologies最新文献

筛选
英文 中文
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems 最小和与最小最大不相交路径问题的复杂性与逼近性
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_7
Peng Zhang, Wenbo Zhao
{"title":"On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems","authors":"Peng Zhang, Wenbo Zhao","doi":"10.1007/978-3-540-74450-4_7","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_7","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126020962","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}
引用次数: 11
On-Line Bin Packing with Arbitrary Release Times 具有任意放行时间的在线装箱
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_31
Yongqiang Shi, Deshi Ye
{"title":"On-Line Bin Packing with Arbitrary Release Times","authors":"Yongqiang Shi, Deshi Ye","doi":"10.1007/978-3-540-74450-4_31","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_31","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162537","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}
引用次数: 2
Streaming Algorithms for Data in Motion 动态数据流算法
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_27
Michael Hoffmann, S. Muthukrishnan, R. Raman
{"title":"Streaming Algorithms for Data in Motion","authors":"Michael Hoffmann, S. Muthukrishnan, R. Raman","doi":"10.1007/978-3-540-74450-4_27","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_27","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133521917","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}
引用次数: 5
On the Complexity of the Max-Edge-Coloring Problem with Its Variants 关于最大边着色问题及其变体的复杂性
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_32
Chang-Wu Yu
{"title":"On the Complexity of the Max-Edge-Coloring Problem with Its Variants","authors":"Chang-Wu Yu","doi":"10.1007/978-3-540-74450-4_32","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_32","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124370822","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}
引用次数: 2
Extending the Hardness of RNA Secondary Structure Comparison 扩展RNA二级结构硬度的比较
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_13
G. Blin, G. Fertin, I. Rusu, Christine Sinoquet
{"title":"Extending the Hardness of RNA Secondary Structure Comparison","authors":"G. Blin, G. Fertin, I. Rusu, Christine Sinoquet","doi":"10.1007/978-3-540-74450-4_13","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_13","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132005888","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}
引用次数: 20
An Approximation Algorithm for the General Mixed Packing and Covering Problem 一般混合填充与覆盖问题的近似算法
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-01 DOI: 10.1007/978-3-540-74450-4_12
F. Diedrich, K. Jansen
{"title":"An Approximation Algorithm for the General Mixed Packing and Covering Problem","authors":"F. Diedrich, K. Jansen","doi":"10.1007/978-3-540-74450-4_12","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_12","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"21 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":"127631758","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
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers 组合数学、算法、概率和实验方法，第一届国际学术研讨会，2007年4月7-9日，中国杭州
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-01 DOI: 10.1007/978-3-540-74450-4
Bo Chen, M. Paterson, Guochuan Zhang
{"title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers","authors":"Bo Chen, M. Paterson, Guochuan Zhang","doi":"10.1007/978-3-540-74450-4","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"40 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":"134397654","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}
引用次数: 44
A New Load Balanced Routing Algorithm for Torus Networks 一种新的环面网络负载均衡路由算法
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-01 DOI: 10.1007/978-3-540-74450-4_44
Jiyun Niu, Huaxi Gu, Changshan Wang
{"title":"A New Load Balanced Routing Algorithm for Torus Networks","authors":"Jiyun Niu, Huaxi Gu, Changshan Wang","doi":"10.1007/978-3-540-74450-4_44","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_44","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"20 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":"130779623","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}
引用次数: 3
CR-precis: A Deterministic Summary Structure for Update Data Streams CR-precis:更新数据流的确定性汇总结构
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2006-09-07 DOI: 10.1007/978-3-540-74450-4_5
Sumit Ganguly, Anirban Majumder
{"title":"CR-precis: A Deterministic Summary Structure for Update Data Streams","authors":"Sumit Ganguly, Anirban Majumder","doi":"10.1007/978-3-540-74450-4_5","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_5","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116721094","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}
引用次数: 44
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信