Titlebook: Approximation and Online Algorithms; 6th International Wo Evripidis Bampis,Martin Skutella Conference proceedings 2009 Springer-Verlag Berl

TRACT

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

JAUNT

inspiration

Ledger

駭人

交響樂

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Treesof instances for which exact solutions can be found efficiently. When the tree is a . (i.e. if only one vertex has degree greater than 2) we give a polynomial-time algorithm to find an optimal solution, as well as a polyhedral description of the convex hull of all integral feasible solutions.

Nerve-Block

Pastry

Stackelberg Strategies and Collusion in Network Games with Splittable Flow single atomic follower. Finally, we investigate SCALE for multiple coalitional followers, general networks, and affine linear latencies. We present the first known upper bound on the price of anarchy in this case. Our bound smoothly varies between 1.5 when .=?0 and full efficiency when .=?1.

裝入膠囊

Peak Shaving through Resource Bufferingty, with the goal of maximizing the amount by which the peak is reduced. We give efficient optimal algorithms for the offline problem, with and without a bounded battery. We also show how to find the optimal offline battery size, given the requirement that the final battery level equals the initial

muster

Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requfunctions in the same form as that of Sharma et al. Using ideas from Goemans and Berstimas [6], we give an (.log.)-approximation algorithm for the resulting problem, where . is the maximum connectivity requirement, and .=?2.54.