Image de couverture de livre

Deterministic counting from coupling independence

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Xiaoyu, Feng, Weiming, Guo, Heng, Zhang, Xinyuan, Zou, Zongrui
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Faster Mixing of the Jerrum-Sinclair Chain
par: Chen, Xiaoyu, et autres
Publié: (2025)

Deterministic approximation for the volume of the truncated fractional matching polytope
par: Guo, Heng, et autres
Publié: (2024)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
par: Feng, Weiming, et autres
Publié: (2025)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
par: Paul-Pena, Daniel, et autres
Publié: (2025)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
par: Iwata, Satoru, et autres
Publié: (2024)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Improved Streaming Algorithm for Fair $k$-Center Clustering
par: Guo, Longkun, et autres
Publié: (2025)

Sink-free orientations: a local sampler with applications
par: Anand, Konrad, et autres
Publié: (2025)

Integrating High-Dimensional Functions Deterministically
par: Gamarnik, David, et autres
Publié: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

Approximation algorithms for non-sequential star packing problems
par: Hu, Mengyuan, et autres
Publié: (2024)

Deterministically finding an element of large order in $\mathbb{Z}_N^*$
par: Nir, Itamar
Publié: (2026)

Explicit Min-wise Hash Families with Optimal Size
par: Chen, Xue, et autres
Publié: (2025)

Minimum Sum Set Cover: Structures and Algorithm
par: Zhang, Zhongyi, et autres
Publié: (2026)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
par: Liang, Wei, et autres
Publié: (2024)

A Tale of Santa Claus, Hypergraphs and Matroids
par: Davies, Sami, et autres
Publié: (2018)

Approximately covering vertices by order-$5$ or longer paths
par: Gong, Mingyang, et autres
Publié: (2024)

Counting random $k$-SAT near the satisfiability threshold
par: Chen, Zongchen, et autres
Publié: (2024)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
par: Swamy, Chaitanya, et autres
Publié: (2025)

All ascents exponential from valued constraint graphs of pathwidth three
par: Kaznatcheev, Artem, et autres
Publié: (2026)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)

Circular-arc graphs and the Helly property
par: Derbisz, Jan, et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Generalizing Roberts' characterization of unit interval graphs
par: Martínez, Virginia Ardévol, et autres
Publié: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
par: Kaul, Matthias, et autres
Publié: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
par: Kakimura, Naonori, et autres
Publié: (2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
par: Disser, Yann, et autres
Publié: (2024)

Nearly Tight Bounds on Testing of Metric Properties
par: Bao, Yiqiao, et autres
Publié: (2024)

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
par: Gawrychowski, Paweł, et autres
Publié: (2024)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
par: Bodini, Olivier, et autres
Publié: (2024)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
par: Manna, Bubai, et autres
Publié: (2024)

Exploring Repetitiveness Measures for Two-Dimensional Strings
par: Romana, Giuseppe, et autres
Publié: (2024)