Titlebook: Algorithms and Complexity; 4th Italian Conferen Giancarlo Bongiovanni,Rossella Petreschi,Giorgio G Conference proceedings 2000 Springer-Ver

不能平庸

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




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




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




書目名稱Algorithms and Complexity網(wǎng)絡公開度學科排名




書目名稱Algorithms and Complexity被引頻次




書目名稱Algorithms and Complexity被引頻次學科排名




書目名稱Algorithms and Complexity年度引用




書目名稱Algorithms and Complexity年度引用學科排名




書目名稱Algorithms and Complexity讀者反饋




書目名稱Algorithms and Complexity讀者反饋學科排名

output

nephritis

Algorithms for a Simple Point Placement Problemen many pairs of them, estimate the relative positions of the points. Problems of this flavor arise in a variety of contexts. The particular motivating example that inspired this work comes from molecular biology; the points are markers on a chromosome and the goal is to map their positions. The pro

Fsh238

CUB

Online Strategies for Backupsaults are rare, i.e. the cost of work between two faults is typically large compared to the cost of one backup. Instead of the (worst- case) competitive ratio we use a refined and more expressive quality measure, in terms of the average fault frequency. This is not standard in the online algorithm l

invade

beta-cells

鄙視

The Hardness of Placing Street Names in a Manhattan Type Mapof maps from a growing and altering set of data. We will show that the problem of placing street names without conflicts in a rectangular grid of streets is NP-complete and APX-hard. This is the first result of this type in this area. Further importance of this result arises from the fact that the c

阻塞

deceive