Copertina

Efficient Uniform Sampling of Surjections via their Profiles

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Carayol, Arnaud, Rotondo, Pablo
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Discrete Mathematics Probability F.2.2; G.2.1
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
di: Adamson, Duncan, et al.
Pubblicazione: (2023)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
di: Shota, Kan, et al.
Pubblicazione: (2024)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
di: Salas, Jesus
Pubblicazione: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
di: Ibrahimpur, Sharat, et al.
Pubblicazione: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
di: Varona, Luis M. B.
Pubblicazione: (2026)

Deterministic Minimum Steiner Cut in Maximum Flow Time
di: Ding, Matthew, et al.
Pubblicazione: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
di: Eiben, Eduard, et al.
Pubblicazione: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
di: Ma, Will, et al.
Pubblicazione: (2025)

Better Approximation for Weighted $k$-Matroid Intersection
di: Singer, Neta, et al.
Pubblicazione: (2024)

Prophet Inequalities: Separating Random Order from Order Selection
di: Giambartolomei, Giordano, et al.
Pubblicazione: (2023)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
di: Giambartolomei, Giordano, et al.
Pubblicazione: (2024)

Approximation Algorithms for Correlated Knapsack Orienteering
di: Espinosa, David Aleman, et al.
Pubblicazione: (2024)

Online Bipartite Matching in the Probe-Commit Model
di: Borodin, Allan, et al.
Pubblicazione: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
di: Ma, Will, et al.
Pubblicazione: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
di: MacRury, Calum, et al.
Pubblicazione: (2022)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
di: Könen, David, et al.
Pubblicazione: (2023)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
di: Gillman, David, et al.
Pubblicazione: (2026)

Weisfeiler-Leman on graphs of small twin-width
di: Heinrich, Irene, et al.
Pubblicazione: (2026)

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

Loop unrolling of UCA models: distance labeling
di: Soulignac, Francisco J, et al.
Pubblicazione: (2022)

Pop Stacks with a Bypass
di: Cioni, Lapo, et al.
Pubblicazione: (2024)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
di: Fairbairn, David L., et al.
Pubblicazione: (2024)

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

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
di: Jacob, Ashwin, et al.
Pubblicazione: (2026)

Faster algorithms on linear delta-matroids
di: Koana, Tomohiro, et al.
Pubblicazione: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
di: Bandopadhyay, Susobhan, et al.
Pubblicazione: (2026)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
di: Nishimura, Yuki, et al.
Pubblicazione: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
di: Kavi, Nithin
Pubblicazione: (2024)

Searching in trees with $k$-up-modular cost functions
di: Szyfelbein, Michał
Pubblicazione: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
di: Jacob, Ashwin, et al.
Pubblicazione: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
di: Streit, Robert P., et al.
Pubblicazione: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
di: Chen, Yijia, et al.
Pubblicazione: (2023)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
di: Gillman, David, et al.
Pubblicazione: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

Computing parameters that generalize interval graphs using restricted modular partitions
di: Bonomo-Braberman, Flavia, et al.
Pubblicazione: (2025)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
di: Shalaby, Ahmed, et al.
Pubblicazione: (2024)

Explicit two-sided unique-neighbor expanders
di: Hsieh, Jun-Ting, et al.
Pubblicazione: (2023)

Lower Bounds for Leaf Rank of Leaf Powers
di: Høgemo, Svein
Pubblicazione: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)