Titlebook: Algorithms and Computation; 22nd International S Takao Asano,Shin-ichi Nakano,Osamu Watanabe Conference proceedings 2011 Springer-Verlag Gm

JAR

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




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




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




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




書目名稱Algorithms and Computation被引頻次




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




書目名稱Algorithms and Computation年度引用




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




書目名稱Algorithms and Computation讀者反饋




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

fixed-joint

ADORN

膽小懦夫

Algorithm Engineering for Route Planning – An Update –icular, new theoretical insights on when and why those techniques work so well will be discussed. The main part of the talk will focus on variants of the problem that occur in more realistic traffic scenarios.

直覺好

Improved Approximations for Buy-at-Bulk and Shallow-Light ,-Steiner Trees and (,,2)-Subgraph.(log..),.(log.))-approximation for SL.ST: the algorithm finds a .-Steiner tree of diameter at most .(.·log.) whose cost is at most . where . is the cost of an LP relaxation of the problem. This improves on the algorithm of [9] with ratio (.(log..), .(log..)). Using this, we obtain an .(log..)-appro

尖

Path Queries in Weighted Treestructure can also support path reporting queries in . time, where . is the size of output. In addition, we present a data structure that answers path reporting queries in . time, using . space. These are the first data structures that answer path reporting queries.

Subdue

receptors

Michael Th. Greven,Oliver von Wrochemo smallest congruent disks such that each disk in . intersects one of these two disks. Then we study the problem of covering the set . by two smallest congruent disks. We give exact and approximation algorithms for these versions.

geometrician

nostrum

Covering and Piercing Disks with Two Centerso smallest congruent disks such that each disk in . intersects one of these two disks. Then we study the problem of covering the set . by two smallest congruent disks. We give exact and approximation algorithms for these versions.