Titlebook: Approximation and Online Algorithms; 14th International W Klaus Jansen,Monaldo Mastrolilli Conference proceedings 2017 Springer Internation

断头台

书目名称Approximation and Online Algorithms影响因子(影响力)




书目名称Approximation and Online Algorithms影响因子(影响力)学科排名




书目名称Approximation and Online Algorithms网络公开度




书目名称Approximation and Online Algorithms网络公开度学科排名




书目名称Approximation and Online Algorithms被引频次




书目名称Approximation and Online Algorithms被引频次学科排名




书目名称Approximation and Online Algorithms年度引用




书目名称Approximation and Online Algorithms年度引用学科排名




书目名称Approximation and Online Algorithms读者反馈




书目名称Approximation and Online Algorithms读者反馈学科排名

摘要

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160427.jpg

绊住

https://doi.org/10.1007/978-3-319-51741-4balanced optimization; computational complexity; online algorithms; probability; robust optimization; alg

自爱

漫步

Afflict

吸引力

Neuere Ergebnisse der Diabetesbehandlung,or service at nodes in a metric space and a time window for each request. The goal is to maximize the number of requests served during their time window. The time to traverse between two points is equal to the distance. Serving a request requires unit time. Irani et al., SODA 2002 considered the spe

Lumbar-Spine

https://doi.org/10.1007/978-3-642-94840-4of disjoint cliques. The cluster editing problem is closely related to correlation clustering and has applications, e.g. in image segmentation. For general graphs this problem is .-hard. In this paper we present an efficient polynomial time approximation scheme for the cluster editing problem on gra

狼群

机械

Gewebsmastzellen und Mastzellen-Reticulose, the same color assignment. For classic graph coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input vertices. In the offline variant, the entire graph is presented at once, and in online problems, o