Cover Image

Deriving differential approximation results for $k\,$CSPs from combinatorial designs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Culus, Jean-François, Toulouse, Sophie
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Computational Complexity 90C27, 68W25, 05B15, 05B30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distributed Computing for Huge-Scale Aggregative Convex Programming
by: Tao, Luoyi
Published: (2026)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
by: Hu, Wei, et al.
Published: (2026)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
by: Friedland, Shmuel, et al.
Published: (2023)

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

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks
by: Dijkstra, Lukas, et al.
Published: (2024)

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

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

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

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
by: He, Xin, et al.
Published: (2026)

On 3-colorability of (claw, diamond)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2026)

On the zeros of partition functions with multi-spin interactions
by: Barvinok, Alexander
Published: (2024)

Domination Reliability
by: Dohmen, Klaus, et al.
Published: (2011)

Distributed Computing for Huge-Scale Linear Programming
by: Tao, Luoyi
Published: (2024)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
by: Atenas, Felipe, et al.
Published: (2024)

On the approximation of the Riemannian barycenter
by: Mataigne, Simon, et al.
Published: (2025)

Recent Advances in the Theory of Polyomino Ideals
by: Navarra, Francesco, et al.
Published: (2025)

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

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
by: Mehiri, El-Mehdi
Published: (2025)

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

Algorithms for the ferromagnetic Potts model on expanders
by: Carlson, Charlie, et al.
Published: (2022)

A New Decomposition Paradigm for Graph-structured Nonlinear Programs via Message Passing
by: Ding, Kuangyu, et al.
Published: (2025)

Integral Biflow Maximization
by: Ding, Guoli, et al.
Published: (2024)

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

Multi-headed lattices and Green functions
by: Chen, Qipin, et al.
Published: (2024)

Classification of flag-transitive $2$-$(v, k, λ)$ designs with alternating group $A_n$($n \le 10$) as socle
by: Tian, Delu, et al.
Published: (2025)

Attempting the impossible: enumerating extremal submodular functions for n=6
by: Csirmaz, Elod P., et al.
Published: (2024)

The characterization of graphs with two trivial distance ideals
by: Alfaro, Carlos A., et al.
Published: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
by: Lara, Felipe, et al.
Published: (2024)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
by: Mokhtari, Yacine
Published: (2025)

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

From semi-total to equitable total colorings
by: Dejter, I. J.
Published: (2025)

Counting List Colorings of Unlabeled Graphs
by: Kaul, Hemanshu, et al.
Published: (2024)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Proof-Carrying Verification for ReLU Networks via Rational Certificates
by: Gokavarapu, Chandrasekhar
Published: (2025)

Geodesic transitive graphs of small valency
by: Huang, Jun-Jie
Published: (2025)

The classification of two-distance transitive dihedrants
by: Huang, Jun-Jie, et al.
Published: (2024)

Finite $s$-geodesic transitive graphs under certain girths
by: Huang, Jun-Jie
Published: (2025)

Coverings of Groups, Regular Dessins, and Surfaces
by: Chen, Jiyong, et al.
Published: (2024)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
by: Roucairol, Milo, et al.
Published: (2024)