Imagen de Portada

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Goswami, Mayank, Jacob, Riko
Formato:	Preprint
Publicado:	2022
Materias:	Data Structures and Algorithms F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

New Sorting Algorithm Wave Sort (W-Sort)
por: Wei, Jia Xu
Publicado: (2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
por: Duan, Ran, et al.
Publicado: (2025)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
por: Gálvez, Waldo, et al.
Publicado: (2025)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
por: Kammer, Frank, et al.
Publicado: (2020)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
por: Mosenzon, Ron
Publicado: (2025)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
por: Goldenberg, Elazar, et al.
Publicado: (2022)

Streaming Algorithms for Bin Packing and Vector Scheduling
por: Cormode, Graham, et al.
Publicado: (2019)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
por: Lindermayr, Alexander, et al.
Publicado: (2025)

Connected Components in Linear Work and Near-Optimal Time
por: Farhadi, Alireza, et al.
Publicado: (2023)

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
por: Chuzhoy, Julia, et al.
Publicado: (2025)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
por: Chakrabarti, Amit, et al.
Publicado: (2024)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
por: Balzotti, Lorenzo
Publicado: (2020)

Min-CSPs on Complete Instances
por: Anand, Aditya, et al.
Publicado: (2024)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Search and evacuation with a near majority of faulty agents
por: Czyzowicz, J., et al.
Publicado: (2026)

Minimizing the Weighted Makespan with Restarts on a Single Machine
por: Amouzandeh, Aflatoun, et al.
Publicado: (2025)

On the Approximability of Unsplittable Flow on a Path with Time Windows
por: Armbruster, Alexander, et al.
Publicado: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
por: Hommelsheim, Felix, et al.
Publicado: (2025)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
por: Bauernöppel, Frank, et al.
Publicado: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
por: Randolph, Tim, et al.
Publicado: (2024)

Online Combinatorial Optimization with Graphical Dependencies
por: Gao, Zhimeng, et al.
Publicado: (2025)

Offline green bin packing and its constrained variant
por: Gong, Mingyang, et al.
Publicado: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
por: Bruchhold, Sebastian, et al.
Publicado: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
por: Awofeso, Christine, et al.
Publicado: (2025)

Online computation of normalized substring complexity
por: Kucherov, Gregory, et al.
Publicado: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
por: Gong, Mingyang, et al.
Publicado: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
por: Blomer, Valentin, et al.
Publicado: (2026)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
por: Emmerich, Michael
Publicado: (2025)

Online $b$-Matching with Stochastic Rewards
por: Albers, Susanne, et al.
Publicado: (2024)

Hierarchical Exponential Search Via K-Spines
por: Dong, Bob
Publicado: (2025)

On the satisfability of random k-Horn formulae
por: Istrate, Gabriel
Publicado: (2000)

Approximation algorithms for Job Scheduling with reconfigurable resources
por: Bergé, Pierre, et al.
Publicado: (2023)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
por: Antoniadis, Antonios, et al.
Publicado: (2020)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
por: Bergougnoux, Benjamin, et al.
Publicado: (2026)