Titlebook: Algorithmic Aspects in Information and Management; 14th International C Zhao Zhang,Wei Li,Ding-Zhu Du Conference proceedings 2020 Springer

Cyclone

書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)




書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學科排名




書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度




書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度學科排名




書目名稱Algorithmic Aspects in Information and Management被引頻次




書目名稱Algorithmic Aspects in Information and Management被引頻次學科排名




書目名稱Algorithmic Aspects in Information and Management年度引用




書目名稱Algorithmic Aspects in Information and Management年度引用學科排名




書目名稱Algorithmic Aspects in Information and Management讀者反饋




書目名稱Algorithmic Aspects in Information and Management讀者反饋學科排名

格言

LAIR

Sebastian Horn,Julia Seeger,Leonie Scheuringic . problem, and was proved to have surprisingly rich connection to the . . problem. In this paper, we give approximation algorithms for . using a non-uniform approach combining LP-rounding and the greedy strategy. With a limited violation of the constraint ., we present a good expected approximation ratio . for ..

保留

團結(jié)

鎮(zhèn)痛劑

箴言

Stephan Schütz,Christian Hellmundd the generic submodularity ratio . of the monotone set function, we prove the algorithm deserves an approximation ratio ., consumes . adaptive rounds, and needs . oracle queries in expectation. Moreover, if the set function is submodular (i. e. .), our algorithm can achieve an approximation guarantee . coinciding with the state-of-art result.

Bernstein-test

Minimum Diameter Vertex-Weighted Steiner Tree, approximation algorithm where . is tight. For the MDWSTP in vertex-weighted .-PG, we first obtain a .-factor approximation algorithm where . is tight, and then develop a slightly improved approximation algorithm.

孵卵器

Approximation Algorithms for the Lower-Bounded Knapsack Median Problem,nd the improved second algorithm is based on an intuitive observation. Additionally, we adapt these two algorithms to the lower-bounded .-median problem (LB .-median) and obtain the approximation ratios of 610 and 387.

擦試不掉