Víctor Verdugo

Available identifiers

zbMath Open verdugo.victorMaRDI QIDQ896268

List of research outcomes

Publication	Date of Publication	Type
The competition complexity of dynamic pricing	2024-11-07	Paper
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time	2024-08-20	Paper
Apportionment with parity constraints	2024-02-21	Paper
Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints	2023-07-26	Paper
How large is your graph?	2023-02-03	Paper
Skyline Computation with Noisy Comparisons	2022-10-13	Paper
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time	2022-08-16	Paper
Optimal revenue guarantees for pricing in large markets	2022-06-01	Paper
Strong Algorithms for the Ordinal Matroid Secretary Problem	2021-07-15	Paper
On the extension complexity of scheduling polytopes	2021-04-07	Paper
Breaking symmetries to rescue sum of squares in the case of makespan scheduling	2020-08-28	Paper
From pricing to prophets, and back!	2020-02-10	Paper
Breaking symmetries to rescue sum of squares in the case of makespan scheduling	2020-02-06	Paper
Semidefinite and linear programming integrality gaps for scheduling identical machines	2018-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q4607929	2018-03-15	Paper
Splitting versus setup trade-offs for scheduling to minimize weighted completion time	2018-02-06	Paper
Brief Announcement	2017-10-11	Paper
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines	2016-08-10	Paper
Strong LP formulations for scheduling splittable jobs on unrelated machines	2015-12-09	Paper
Split scheduling with uniform setup times	2015-04-24	Paper
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines	2014-06-02	Paper

Research outcomes over time

This page was built for person: Víctor Verdugo