( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median.

, , , и . SODA, стр. 940-986. SIAM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Fabrizio Catanese

Fabrizio Gabbiani

Fabrizio Gabrielli

Fabrizio Lindner

Fabrizio Arosio

 

Другие публикации лиц с тем же именем

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path., , , и . IPCO, том 7801 из Lecture Notes in Computer Science, стр. 25-36. Springer, (2013)Pricing on Paths: A PTAS for the Highway Problem., и . SODA, стр. 675-684. SIAM, (2011)All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier., , , , и . SODA, стр. 273-289. SIAM, (2021)Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract)., , и . ESA, том 8125 из Lecture Notes in Computer Science, стр. 361-372. Springer, (2013)Faster Steiner Tree Computation in Polynomial-Space., , и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 430-441. Springer, (2008)On Min-Power Steiner Tree.. ESA, том 7501 из Lecture Notes in Computer Science, стр. 527-538. Springer, (2012)Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation., , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 206-217. Springer, (2007)Optimal Resilient Dynamic Dictionaries., , , , , , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 347-358. Springer, (2007)Computing Optimal Steiner Trees in Polynomial Space., , , , и . Algorithmica, 65 (3): 584-604 (2013)The Serial Microprocessor Array (SMA): Microprogramming and Application Examples., , , , и . ISCA, стр. 230-235. ACM, (1978)