Imagen de Portada

Prediction-Augmented Mechanism Design for Weighted Facility Location

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shi, Yangguang, Xue, Zhenyu
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computer Science and Game Theory Machine Learning 68W27, 68Q32 F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

String 2-Covers with No Length Restrictions
por: Boneh, Itai, et al.
Publicado: (2024)

Hairpin Completion Distance Lower Bound
por: Boneh, Itai, et al.
Publicado: (2024)

Maximizing Diversity in (near-)Median String Selection
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
por: Crochemore, Maxime, et al.
Publicado: (2025)

Computing Maximal Repeating Subsequences in a String
por: Gong, Mingyang, et al.
Publicado: (2026)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

The Exchange Problem
por: Garg, Mohit, et al.
Publicado: (2024)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
por: Feldman, Moran, et al.
Publicado: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
por: Date, Vinicius T. V., et al.
Publicado: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
por: Komusiewicz, Christian, et al.
Publicado: (2023)

Fast FPT Algorithms for Grundy Number on Dense Graphs
por: Nezhad, Sina Ghasemi, et al.
Publicado: (2024)

Minimum-cost paths for electric cars
por: Dorfman, Dani, et al.
Publicado: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
por: Filmus, Yuval, et al.
Publicado: (2024)

PPSZ is better than you think
por: Scheder, Dominik
Publicado: (2022)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
por: Gu, Qian-Ping, et al.
Publicado: (2025)

Parameterized Algorithms for Kidney Exchange
por: Maiti, Arnab, et al.
Publicado: (2021)

Fair Division in a Variable Setting
por: Chandramouleeswaran, Harish, et al.
Publicado: (2024)

Optimal non-adaptive algorithm for edge estimation
por: Bishnu, Arijit, et al.
Publicado: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
por: Borodin, Allan, et al.
Publicado: (2025)

Steiner Tree Parameterized by Multiway Cut and Even Less
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., et al.
Publicado: (2026)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
por: Bojikian, Narek, et al.
Publicado: (2025)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
por: Gupta, Swati, et al.
Publicado: (2025)

Naively Sorting Evolving Data is Optimal and Robust
por: Giakkoupis, George, et al.
Publicado: (2024)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
por: Li, Shisheng
Publicado: (2026)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
por: Golovach, Petr A., et al.
Publicado: (2022)