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

斷頭臺(tái)

書目名稱Approximation and Online Algorithms影響因子(影響力)




書目名稱Approximation and Online Algorithms影響因子(影響力)學(xué)科排名




書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度




書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Approximation and Online Algorithms被引頻次




書目名稱Approximation and Online Algorithms被引頻次學(xué)科排名




書目名稱Approximation and Online Algorithms年度引用




書目名稱Approximation and Online Algorithms年度引用學(xué)科排名




書目名稱Approximation and Online Algorithms讀者反饋




書目名稱Approximation and Online Algorithms讀者反饋學(xué)科排名

摘要

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

自愛(ài)

漫步

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

狼群

機(jī)械

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