Titlebook: Algorithm Theory -- SWAT 2012; 13th Scandinavian Sy Fedor V. Fomin,Petteri Kaski Conference proceedings 2012 Springer-Verlag Berlin Heidelb

漫不經(jīng)心

Kasseler Edition Soziale ArbeitWe present an .(.. loglog./log..) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of .(.. (loglog.)./log.. ) time.

協(xié)奏曲

截?cái)?/a>

Algorithm Theory -- SWAT 2012978-3-642-31155-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

鐵塔等

Fedor V. Fomin,Petteri KaskiState-of-the-art research.Fast-track conference proceedings.Unique visibility

apropos

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152836.jpg

違抗

Excitotoxin

骨

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares,wen (2009) before our work was 2. Our scheme can be generalized to the budgeted unique unit-square coverage problem, in which each point has a profit, each square has a cost, and we wish to maximize the total profit of the uniquely covered points under the condition that the total cost is at most a given bound.

intertwine

On Minimum Sum of Radii and Diameters Clustering,SR problem, we give an exact algorithm when the metric is the shortest-path metric of an unweighted graph and there cannot be any singleton clusters. For the MSD problem on the plane with Euclidean distances, we present a polynomial time approximation scheme.

精密

Faster Parameterized Algorithms for Deletion to Split Graphs,nels for the problem. More precisely,.In addition, we note that our algorithm for .? adds to the small number of subexponential parameterized algorithms not obtained through bidimensionality, and on general graphs.