Copertina

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Chakraborty, Arya
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms F.2.0
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
di: De Stefani, Lorenzo, et al.
Pubblicazione: (2024)

Clustering Permutations: New Techniques with Streaming Applications
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2022)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
di: Hušek, Radek, et al.
Pubblicazione: (2020)

Arcee: An OCM-Solver
di: Boehmer, Kimon, et al.
Pubblicazione: (2024)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
di: Boneh, Itai, et al.
Pubblicazione: (2025)

Planar Multiway Cut with Terminals on Few Faces
di: Pandey, Sukanya, et al.
Pubblicazione: (2025)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
di: Degryse, Mathis, et al.
Pubblicazione: (2026)

An Optimal Randomized Algorithm for Finding the Saddlepoint
di: Dallant, Justin, et al.
Pubblicazione: (2024)

Online Paging with Heterogeneous Cache Slots
di: Chrobak, Marek, et al.
Pubblicazione: (2022)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
di: Borodin, Allan, et al.
Pubblicazione: (2025)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
di: Chen, Yongyu
Pubblicazione: (2023)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
di: Gupta, Swati, et al.
Pubblicazione: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
di: Gupta, Swati, et al.
Pubblicazione: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
di: Gupta, Swati, et al.
Pubblicazione: (2023)

Stochastic Function Certification with Correlations
di: Ghuge, Rohan, et al.
Pubblicazione: (2026)

Replicability in High Dimensional Statistics
di: Hopkins, Max, et al.
Pubblicazione: (2024)

The Degree of Fairness in Efficient House Allocation
di: Hosseini, Hadi, et al.
Pubblicazione: (2024)

New Entropy Measures for Tries with Applications to the XBWT
di: Carfagna, Lorenzo, et al.
Pubblicazione: (2025)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
di: Chauhan, Archit, et al.
Pubblicazione: (2026)

Efficient Approximation of Fractional Hypertree Width
di: Korchemna, Viktoriia, et al.
Pubblicazione: (2024)

Faster Multi-Source Directed Reachability via Shortcuts and Matrix Multiplication
di: Elkin, Michael, et al.
Pubblicazione: (2024)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
di: Feng, Weiming, et al.
Pubblicazione: (2022)

Online Bin Packing with Predictions
di: Angelopoulos, Spyros, et al.
Pubblicazione: (2021)

I/O complexity and pebble games with partial computations
di: Sobczyk, Aleksandros
Pubblicazione: (2024)

On the formalization of the notion of an algorithm
di: Middelburg, C. A.
Pubblicazione: (2024)

On the formalization of the notion of a concurrent algorithm
di: Middelburg, C. A.
Pubblicazione: (2024)

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

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
di: Assadi, Sepehr, et al.
Pubblicazione: (2022)

Provable Accuracy Bounds for Hybrid Dynamical Optimization and Sampling
di: Burns, Matthew X., et al.
Pubblicazione: (2024)

Formalizing the notions of non-interactive and interactive algorithms
di: Middelburg, C. A.
Pubblicazione: (2024)

Efficiency of Self-Adjusting Heaps
di: Sinnamon, Corwin, et al.
Pubblicazione: (2023)

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

PPSZ is better than you think
di: Scheder, Dominik
Pubblicazione: (2022)

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

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
di: Goswami, Mayank, et al.
Pubblicazione: (2022)

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

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

Convergence analysis of t-SNE as a gradient flow for point cloud on a manifold
di: Jeong, Seonghyeon, et al.
Pubblicazione: (2024)

New Sorting Algorithm Wave Sort (W-Sort)
di: Wei, Jia Xu
Pubblicazione: (2025)