:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Blomer, Valentin, Bux, Kai-Uwe
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms F.2.2
Accès en ligne:	https://arxiv.org/abs/2601.00979
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

Approximation algorithms for Job Scheduling with reconfigurable resources
par: Bergé, Pierre, et autres
Publié: (2023)

A faster algorithm for the construction of optimal factoring automata
par: Erlebach, Thomas, et autres
Publié: (2024)

An improved local search based algorithm for $k^-$-star partition
par: Gong, Mingyang, et autres
Publié: (2025)

Faster shortest-path algorithms using the acyclic-connected tree
par: Stefansson, Elis, et autres
Publié: (2025)

Customizable Contraction Hierarchies -- A Survey
par: Bläsius, Thomas, et autres
Publié: (2025)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

Faster algorithms on linear delta-matroids
par: Koana, Tomohiro, et autres
Publié: (2024)

Towards universally optimal sorting algorithms
par: Sen, Sandeep
Publié: (2025)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

A polynomial-time algorithm for recognizing high-bandwidth graphs
par: Varona, Luis M. B.
Publié: (2026)

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
par: Sarriguren, Alfredo Goñi
Publié: (2024)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
par: Hochbaum, Dorit S.
Publié: (2016)

Offline green bin packing and its constrained variant
par: Gong, Mingyang, et autres
Publié: (2026)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

A $2$-branching construction for the $χ\leq 2r$ bound
par: Date, Vinicius Tikara Venturi, et autres
Publié: (2026)

SimdQuickHeap: The QuickHeap Reconsidered
par: Breitling, Johannes, et autres
Publié: (2026)

Approximately Partitioning Vertices into Short Paths
par: Gong, Mingyang, et autres
Publié: (2026)

On the Online Weighted Non-Crossing Matching Problem
par: Boyar, Joan, et autres
Publié: (2026)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
par: Roditty, Liam, et autres
Publié: (2026)

Forwarding Packets Greedily
par: Boyar, Joan, et autres
Publié: (2026)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

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

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
par: Antoniadis, Antonios, et autres
Publié: (2020)

Online Interval Scheduling with Predictions
par: Boyar, Joan, et autres
Publié: (2023)

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
par: Amouzandeh, Aflatoun, et autres
Publié: (2025)