Cover Image

Benchmarking of algorithms for set partitions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Khinvasara, Arnav, Pikovski, Alexander
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Discrete Mathematics Software Engineering Combinatorics 05A18, 05A15, 68R05, 90C27 F.2; G.2.1; F.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Simple Approximations for General Spanner Problems
by: Bökler, Fritz, et al.
Published: (2025)

Exact Minimum Weight Spanners via Column Generation
by: Bökler, Fritz, et al.
Published: (2024)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
by: Komusiewicz, Christian, et al.
Published: (2023)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
by: Alimi, Morteza, et al.
Published: (2025)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
by: Chimani, Markus, et al.
Published: (2023)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
by: Feldman, Moran, et al.
Published: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Ordered Leaf Attachment (OLA) Vectors can Identify Reticulation Events even in Multifurcated Trees
by: Markin, Alexey, et al.
Published: (2025)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
by: Flores-Peñaloza, David, et al.
Published: (2024)

Bell Numbers and Stirling Numbers of the Mycielskian of Trees
by: Allagan, J., et al.
Published: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

Greedy Sets and Greedy Numerical Semigroups
by: Pérez-Rosés, Hebert, et al.
Published: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

A Stopping Game on Zero-Sum Sequences
by: Dumitrescu, Adrian, et al.
Published: (2024)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Posets are easily testable
by: Fekete, Panna Tímea, et al.
Published: (2023)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Graph Parameters, Universal Obstructions, and WQO
by: Paul, Christophe, et al.
Published: (2023)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
by: Dahlmeier, J Niklas, et al.
Published: (2025)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
by: Patzner, Julian, et al.
Published: (2024)