Titlebook: Approximation and Online Algorithms; 10th International W Thomas Erlebach,Giuseppe Persiano Conference proceedings 2013 Springer-Verlag Ber

HBA1C

書目名稱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é)科排名

chlorosis

Independent Set with Advice: The Impact of Graph Knowledgehe size of the advice needed to solve the problem efficiently. On one hand, we show that, for sparse graphs, constant-size advice is sufficient to solve the maximum independent set problem with constant competitive ratio, even with no knowledge of the underlying graph. On the other hand, we show a l

Palate

Online Multi-Commodity Flow with High Demands than the edge capacities of the network..We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor..The algorithm can handle two types of flow

Palpate

心胸開闊

男生戴手銬

Expiration

Probabilistic ,-Median Clustering in Data Streamsn problem in the metric and Euclidean case. The coresets are of size poly(..,.,log(./(.. ·.. ·.))), where . is the expected total weight of the weighted probabilistic input points, .. is the minimum weight of a probabilistic input point, .. is the minimum realization probability, and . is the error

PLUMP

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphslication in wireless ad-hoc networks. Since the minimum dominating set problem for unit disk graphs is NP-hard, several approximation algorithms with different merits have been proposed in the literature. On one extreme, there is a linear time 5-approximation algorithm. On another extreme, there are

Valves

On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoodss in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree

擁擠前