SAT-Based Search for Minwise Independent Families

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Iurlano, Enrico, Raidl, Günther R.
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics 90C27, 68R05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)

Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)

Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
by: Simmons, Miles, et al.
Published: (2025)

Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)

New Vertex Ordering Characterizations of Circular-Arc Bigraphs
by: Paul, Indrajit, et al.
Published: (2025)

Reducing Dominating Sets in Graphs
by: Inza, Ernesto Parra, et al.
Published: (2024)

A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)

Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

Weighted domination models and randomized heuristics
by: Dijkstra, Lukas, et al.
Published: (2022)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

Census Dual Graphs: Properties and Random Graph Models
by: Anderson, Sara, et al.
Published: (2026)

An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)

The weighted Tower of Hanoi
by: Mehiri, El-Mehdi, et al.
Published: (2022)

Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

Packing, Hitting, and Colouring Squares
by: Caoduro, Marco, et al.
Published: (2022)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
by: Masing, Berenike, et al.
Published: (2024)

On the redundancy of transitivity constraints in the clique partitioning problem
by: Sukegawa, Noriyoshi
Published: (2026)

Moment generating functions in combinatorial optimization: Bipartite matching
by: Wästlund, Johan
Published: (2026)

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

Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)

Closeness and Residual Closeness of Harary Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2023)

Extending the definition of set tolerances
by: Jäger, Gerold, et al.
Published: (2024)

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)

Supermodular Maximization with Cardinality Constraints
by: Chen, Xujin, et al.
Published: (2025)

Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
by: Haxell, Penny, et al.
Published: (2022)

Structure of $k$-Matching-Planar Graphs
by: Hendrey, Kevin, et al.
Published: (2025)

On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs
by: Robertson, Sawyer, et al.
Published: (2023)

Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)

Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)

Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)