Titlebook: Algorithms and Complexity; 8th International Co Paul G. Spirakis,Maria Serna Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

氣泡

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




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




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




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




書目名稱Algorithms and Complexity被引頻次




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




書目名稱Algorithms and Complexity年度引用




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




書目名稱Algorithms and Complexity讀者反饋




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

織物

exceptional

軌道

Jacket

Eviction

Decentralized Throughput Scheduling,ria that are at most a factor (.?+?1) away from the global optimum, and this bound is tight. For identical machines, we improve this bound to ., which is shown to be tight, too. The latter result is obtained by considering subgame perfect equilibria of a corresponding sequential game. We also address some variations of the problem.

LITHE

0302-9743 he 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and

MURAL

被告

Money-Based Coordination of Network Packets, by mutually trading their positions in router queues. We consider a corresponding Markov model of trade and show that there are Nash equilibria (NE) where queue positions and money are exchanged directly between the network packets. This simple approach, interestingly, delivers significant improvements for packets and routers.

BABY

Michael Stahlmann,Walter Wendt-KleinbergDP). The algorithm achieves approximation ratio 1.5 for both directed and undirected graphs. We show that a .-approximation algorithm for MA2NDP with fixed activation values for . and . yields a .-approximation algorithm for the . (MA2EDP) problem. We also study the MA2NDP and MA2EDP problems for the special case |.|?=?2.