Image de couverture de livre

Arcee: An OCM-Solver

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Boehmer, Kimon, George, Lukas Lee, Hauser, Fanny, Palarus, Jesse
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms F.2.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric
par: Chakraborty, Arya
Publié: (2024)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
par: De Stefani, Lorenzo, et autres
Publié: (2024)

Clustering Permutations: New Techniques with Streaming Applications
par: Chakraborty, Diptarka, et autres
Publié: (2022)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
par: Hušek, Radek, et autres
Publié: (2020)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
par: Boneh, Itai, et autres
Publié: (2025)

Planar Multiway Cut with Terminals on Few Faces
par: Pandey, Sukanya, et autres
Publié: (2025)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
par: Degryse, Mathis, et autres
Publié: (2026)

Online Paging with Heterogeneous Cache Slots
par: Chrobak, Marek, et autres
Publié: (2022)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Submodular Max-Min Allocation under Identical Valuations
par: Boehmer, Kimon
Publié: (2026)

An Optimal Randomized Algorithm for Finding the Saddlepoint
par: Dallant, Justin, et autres
Publié: (2024)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
par: Gupta, Swati, et autres
Publié: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
par: Gupta, Swati, et autres
Publié: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
par: Gupta, Swati, et autres
Publié: (2023)

Stochastic Function Certification with Correlations
par: Ghuge, Rohan, et autres
Publié: (2026)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
par: Chen, Yongyu
Publié: (2023)

Replicability in High Dimensional Statistics
par: Hopkins, Max, et autres
Publié: (2024)

The Degree of Fairness in Efficient House Allocation
par: Hosseini, Hadi, et autres
Publié: (2024)

New Entropy Measures for Tries with Applications to the XBWT
par: Carfagna, Lorenzo, et autres
Publié: (2025)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
par: Chauhan, Archit, et autres
Publié: (2026)

Efficient Approximation of Fractional Hypertree Width
par: Korchemna, Viktoriia, et autres
Publié: (2024)

Faster Multi-Source Directed Reachability via Shortcuts and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2024)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
par: Feng, Weiming, et autres
Publié: (2022)

Online Bin Packing with Predictions
par: Angelopoulos, Spyros, et autres
Publié: (2021)

I/O complexity and pebble games with partial computations
par: Sobczyk, Aleksandros
Publié: (2024)

On the formalization of the notion of an algorithm
par: Middelburg, C. A.
Publié: (2024)

Provable Accuracy Bounds for Hybrid Dynamical Optimization and Sampling
par: Burns, Matthew X., et autres
Publié: (2024)

On the formalization of the notion of a concurrent algorithm
par: Middelburg, C. A.
Publié: (2024)

Formalizing the notions of non-interactive and interactive algorithms
par: Middelburg, C. A.
Publié: (2024)

Max-Cut with $ε$-Accurate Predictions
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

PPSZ is better than you think
par: Scheder, Dominik
Publié: (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
par: Hochbaum, Dorit S.
Publié: (2016)

PAC Learning is just Bipartite Matching (Sort of)
par: Dughmi, Shaddin
Publié: (2025)

Faster Mixing for Triangulations via Transport Flows
par: Alev, Vedat Levi, et autres
Publié: (2026)

Convergence analysis of t-SNE as a gradient flow for point cloud on a manifold
par: Jeong, Seonghyeon, et autres
Publié: (2024)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

Learning-Based TSP-Solvers Tend to Be Overly Greedy
par: Li, Xiayang, et autres
Publié: (2025)

Reducing Matroid Optimization to Basis Search
par: Streit, Robert, et autres
Publié: (2024)

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
par: Künnemann, Marvin, et autres
Publié: (2024)