:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Wen-Ling, Huang, Hong-Chang, Lin, Kai-Hung, Hwang, Shang-Wei, Yang, Hao-Tsung
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2502.07214
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
por: Funke, Daniel, et al.
Publicado: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Online Steiner Forest with Recourse
por: Long, Yaowei, et al.
Publicado: (2026)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
por: Forster, Sebastian, et al.
Publicado: (2024)

Parameterized Algorithms for Computing Pareto Sets
por: Könen, Joshua, et al.
Publicado: (2025)

Dynamic Set Cover with Worst-Case Recourse
por: Solomon, Shay, et al.
Publicado: (2025)

Fully-Dynamic Submodular Cover with Bounded Recourse
por: Gupta, Anupam, et al.
Publicado: (2020)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

Efficient Streaming Algorithms for Two-Dimensional Congruence Testing and Geometric Hashing
por: Chang, Yen-Cheng, et al.
Publicado: (2026)

Beyond Vizing Chains: Improved Recourse in Dynamic Edge Coloring
por: Sadeh, Yaniv, et al.
Publicado: (2026)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
por: Meierhans, Simon, et al.
Publicado: (2025)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
por: Huang, Zengfeng, et al.
Publicado: (2025)

The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
por: Li, Shuguang, et al.
Publicado: (2025)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
por: de Berg, Sarita, et al.
Publicado: (2026)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

Revisiting Local Computation of PageRank: Simple and Optimal
por: Wang, Hanzhi, et al.
Publicado: (2024)

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
por: Benomar, Ziyad, et al.
Publicado: (2025)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
por: Chen, Ho-Lin, et al.
Publicado: (2026)

Efficient Algorithms for Personalized PageRank Computation: A Survey
por: Yang, Mingji, et al.
Publicado: (2024)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
por: Lee, Russell, et al.
Publicado: (2022)

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
por: Lin, Honghao, et al.
Publicado: (2025)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
por: Hwang, Samuel, et al.
Publicado: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
por: Kavitha, Telikepalli, et al.
Publicado: (2026)

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
por: Karathanasis, Konstantinos, et al.
Publicado: (2025)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

Near-Optimal Algorithm for Directed Expander Decompositions
por: Sulser, Aurelio L., et al.
Publicado: (2024)

Optimal Learning-Augmented Algorithm for Online Bidding
por: Lee, Changyeol, et al.
Publicado: (2026)

A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms
por: Kirkpatrick, Yael, et al.
Publicado: (2024)

Optimal Algorithms for Free Order Multiple-Choice Secretary
por: Hajiaghayi, Mohammad Taghi, et al.
Publicado: (2022)