( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

, , и . SIAM J. Comput., 40 (2): 567-596 (2011)

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.

Monaldo Mastrolilli

Palmo Monaldo Mastrolilli

 

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

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands., , , , , , , и . J. Math. Model. Algorithms, 5 (1): 91-110 (2006)Sum-of-squares hierarchy lower bounds for symmetric formulations., , и . Math. Program., 182 (1): 369-397 (2020)Parallel Machine Scheduling Problems with Controllable Processing Times., и . ICALP Satellite Workshops, стр. 179-190. Carleton Scientific, Waterloo, Ontario, Canada, (2000)Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge., и . Hybrid Metaheuristics, том 4771 из Lecture Notes in Computer Science, стр. 123-139. Springer, (2007)Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands., , , , , , , и . PPSN, том 3242 из Lecture Notes in Computer Science, стр. 450-460. Springer, (2004)On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation., , , , и . CoRR, (2024)Ideal Membership Problem for Boolean Minority and Dual Discriminator., и . MFCS, том 202 из LIPIcs, стр. 16:1-16:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain.. SODA, стр. 456-475. SIAM, (2019)The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain.. CoRR, (2019)Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut, , и . SIAM J. Comput., 40 (2): 567-596 (2011)