Image de couverture de livre

Minimum-cost paths for electric cars

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dorfman, Dani, Kaplan, Haim, Tarjan, Robert E., Thorup, Mikkel, Zwick, Uri
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms 68W05 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Faster All-Pairs Optimal Electric Car Routing
par: Dorfman, Dani, et autres
Publié: (2025)

String 2-Covers with No Length Restrictions
par: Boneh, Itai, et autres
Publié: (2024)

Hairpin Completion Distance Lower Bound
par: Boneh, Itai, et autres
Publié: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

Maximizing Diversity in (near-)Median String Selection
par: Chakraborty, Diptarka, et autres
Publié: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

PPSZ is better than you think
par: Scheder, Dominik
Publié: (2022)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

Tree Containment Parameterized by Scanwidth
par: van Iersel, Leo, et autres
Publié: (2026)

The Li-Chao Tree: Algorithm Specification and Analysis
par: Li, Chao
Publié: (2026)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

APTAS for bin packing with general cost structures
par: Jaykrishnan, G., et autres
Publié: (2024)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)

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

Efficiency of Self-Adjusting Heaps
par: Sinnamon, Corwin, et autres
Publié: (2023)

The Distributional Tail of Worst-Case Quickselect
par: Płecha, Witold
Publié: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Online coloring of short interval graphs and two-count interval graphs
par: Curbelo, Israel R.
Publié: (2024)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
par: Patzner, Julian, et autres
Publié: (2024)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
par: Shigemizu, Mika, et autres
Publié: (2018)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Naively Sorting Evolving Data is Optimal and Robust
par: Giakkoupis, George, et autres
Publié: (2024)

Computing Maximal Repeating Subsequences in a String
par: Gong, Mingyang, et autres
Publié: (2026)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Testing forbidden order-pattern properties on hypergrids
par: Chandramouleeswaran, Harish, et autres
Publié: (2025)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
par: Komusiewicz, Christian, et autres
Publié: (2023)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)