Pub Date : 2007-04-07DOI: 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}
Pub Date : 2007-04-07DOI: 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}
Pub Date : 2007-04-07DOI: 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}
Pub Date : 2007-04-07DOI: 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}
Pub Date : 2007-04-01DOI: 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}
Pub Date : 2006-09-07DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：