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

Efficient Approximation and Online Algorithms最新文献

筛选
英文 中文
Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications 高效逼近和在线算法——经典组合优化问题的最新进展及其新应用
Efficient Approximation and Online Algorithms Pub Date : 2006-03-01 DOI: 10.1007/11671541
E. Bampis, K. Jansen, C. Kenyon
{"title":"Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications","authors":"E. Bampis, K. Jansen, C. Kenyon","doi":"10.1007/11671541","DOIUrl":"https://doi.org/10.1007/11671541","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003597","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}
引用次数: 8
Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications 最小-最大和最大-最小资源共享问题的逼近算法及其应用
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_6
K. Jansen
{"title":"Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications","authors":"K. Jansen","doi":"10.1007/11671541_6","DOIUrl":"https://doi.org/10.1007/11671541_6","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128757127","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
Approximation Algorithms for Path Coloring in Trees 树中路径着色的近似算法
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_3
I. Caragiannis, C. Kaklamanis, G. Persiano
{"title":"Approximation Algorithms for Path Coloring in Trees","authors":"I. Caragiannis, C. Kaklamanis, G. Persiano","doi":"10.1007/11671541_3","DOIUrl":"https://doi.org/10.1007/11671541_3","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126899298","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}
引用次数: 6
A Survey of Approximation Results for Local Search Algorithms 局部搜索算法的近似结果综述
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_2
Eric Angel
{"title":"A Survey of Approximation Results for Local Search Algorithms","authors":"Eric Angel","doi":"10.1007/11671541_2","DOIUrl":"https://doi.org/10.1007/11671541_2","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"126 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120819133","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}
引用次数: 24
Approximation Algorithms for the k-Median Problem k-中值问题的近似算法
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_10
Roberto Solis-Oba
{"title":"Approximation Algorithms for the k-Median Problem","authors":"Roberto Solis-Oba","doi":"10.1007/11671541_10","DOIUrl":"https://doi.org/10.1007/11671541_10","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115295089","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}
引用次数: 9
Independence and Coloring Problems on Intersection Graphs of Disks 圆盘相交图的独立性与着色问题
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_5
T. Erlebach, J. Fiala
{"title":"Independence and Coloring Problems on Intersection Graphs of Disks","authors":"T. Erlebach, J. Fiala","doi":"10.1007/11671541_5","DOIUrl":"https://doi.org/10.1007/11671541_5","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"17 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120893500","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}
引用次数: 22
Approximating a Class of Classification Problems 一类分类问题的近似
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_8
I. Milis
{"title":"Approximating a Class of Classification Problems","authors":"I. Milis","doi":"10.1007/11671541_8","DOIUrl":"https://doi.org/10.1007/11671541_8","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121123474","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}
引用次数: 0
On Approximation Algorithms for Data Mining Applications 数据挖掘应用中的近似算法
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_1
F. Afrati
{"title":"On Approximation Algorithms for Data Mining Applications","authors":"F. Afrati","doi":"10.1007/11671541_1","DOIUrl":"https://doi.org/10.1007/11671541_1","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122968225","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}
引用次数: 7
The Lovász-Local-Lemma and Scheduling Lovász-Local-Lemma和调度
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_11
A. Srivastav
{"title":"The Lovász-Local-Lemma and Scheduling","authors":"A. Srivastav","doi":"10.1007/11671541_11","DOIUrl":"https://doi.org/10.1007/11671541_11","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117310139","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}
引用次数: 1
List Scheduling in Order of α-Points on a Single Machine 单机器上α-点排序的列表调度
Efficient Approximation and Online Algorithms Pub Date : 1900-01-01 DOI: 10.1007/11671541_9
M. Skutella
{"title":"List Scheduling in Order of α-Points on a Single Machine","authors":"M. Skutella","doi":"10.1007/11671541_9","DOIUrl":"https://doi.org/10.1007/11671541_9","url":null,"abstract":"","PeriodicalId":254551,"journal":{"name":"Efficient Approximation and Online Algorithms","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128084013","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}
引用次数: 25
下一页 尾页
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学术官方微信