Imagen de Portada

Sublinear-Time Computation in the Presence of Online Erasures

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kalemaj, Iden, Raskhodnikova, Sofya, Varma, Nithin
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Discrete Mathematics 68Q25 F.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)

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

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
por: Davari, Morteza, et al.
Publicado: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

APTAS for bin packing with general cost structures
por: Jaykrishnan, G., et al.
Publicado: (2024)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
por: Nicosia, Gaia, et al.
Publicado: (2026)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
por: Mundhra, S.
Publicado: (2025)

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

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

Searching in trees with monotonic query times
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
por: Meusel, Julia, et al.
Publicado: (2025)

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

Optimal Discretization is Fixed-parameter Tractable
por: Kratsch, Stefan, et al.
Publicado: (2020)

Overlapping Biclustering
por: Bentert, Matthias, et al.
Publicado: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
por: Kullmann, Oliver, et al.
Publicado: (2026)

Pliability and Approximating Max-CSPs
por: Romero, Miguel, et al.
Publicado: (2019)

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)

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

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

On weighted graph separation problems and flow-augmentation
por: Kim, Eun Jung, et al.
Publicado: (2022)

An Algorithm to Recover Shredded Random Matrices
por: Atamanchuk, Caelan, et al.
Publicado: (2023)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

A New Temporal Interpretation of Cluster Editing
por: Bocci, Cristiano, et al.
Publicado: (2022)

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
por: Misra, Neeldhara, et al.
Publicado: (2022)

On Solving Simple Curved Nonograms
por: Löffler, Maarten, et al.
Publicado: (2025)

Maximum Matchings in Geometric Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2019)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
por: Mühlenthaler, Moritz, et al.
Publicado: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
por: Buchbinder, Niv, et al.
Publicado: (2024)

Computing parameters that generalize interval graphs using restricted modular partitions
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
por: Bampis, Evripidis, et al.
Publicado: (2024)