Image de couverture de livre

Structured Decompositions: Structural and Algorithmic Compositionality

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bumpus, Benjamin Merlin, Kocsis, Zoltan A., Master, Jade Edenstar, Minichiello, Emilio
Format:	Preprint
Publié:	2022
Sujets:	Category Theory Data Structures and Algorithms Combinatorics 18B10, 05C75 (Primary) 68W40 (Secondary) F.2.m; G.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards a Unified Theory of Time-Varying Data
par: Bumpus, Benjamin Merlin, et autres
Publié: (2024)

On the on-line coloring of unit interval graphs with proper interval representation
par: Curbelo, Israel R., et autres
Publié: (2024)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
par: Coşa, Matei Gabriel, et autres
Publié: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
par: Gupta, Swati, et autres
Publié: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
par: Gupta, Swati, et autres
Publié: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
par: Gupta, Swati, et autres
Publié: (2023)

Stochastic Function Certification with Correlations
par: Ghuge, Rohan, et autres
Publié: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)

Mean-Biased Processes for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

Tight complexity bounds for diagram commutativity verification
par: Malko, Artem, et autres
Publié: (2025)

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

Algorithms Transcending the SAT-Symmetry Interface
par: Anders, Markus, et autres
Publié: (2023)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs
par: Kuchukova, Aiya, et autres
Publié: (2024)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

Lassos: Pushing Tree Decompositions Forward Along Homomorphisms
par: Bumpus, Benjamin Merlin, et autres
Publié: (2024)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
par: Galby, Esther, et autres
Publié: (2024)

A scalable clustering algorithm to approximate graph cuts
par: Suchan, Leo, et autres
Publié: (2023)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

On Distributed Colouring of Hyperbolic Random Graphs
par: Maus, Yannic, et autres
Publié: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
par: Lynch, Nancy
Publié: (2024)

On the Advice Complexity of Online Unit Clustering
par: Nagy-György, Judit
Publié: (2023)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
par: Gribelyuk, Elena, et autres
Publié: (2024)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
par: Hung, Chia-Yang, et autres
Publié: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

Zero-free regions of partition functions with applications to algorithms and graph limits
par: Regts, Guus
Publié: (2015)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)