Image de couverture de livre

Scarf's Algorithm on Arborescence Hypergraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chandrasekaran, Karthekeyan, Faenza, Yuri, He, Chengyue, Sethuraman, Jay
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Combinatorics 90C49 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Relaxation strength for multilinear optimization: McCormick strikes back
par: Schutte, Emily, et autres
Publié: (2023)

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit
par: Cheng, Christine T., et autres
Publié: (2026)

A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
par: Goldberg, Noam, et autres
Publié: (2026)

On the complexity of a maintenance problem for hierarchical systems
par: Schulz, Andreas S., et autres
Publié: (2023)

A new density limit for unanimity in majority dynamics on random graphs
par: Kim, Jeong Han, et autres
Publié: (2025)

On λ-backbone coloring of cliques with tree backbones in linear time
par: Michalik, Krzysztof, et autres
Publié: (2021)

The frequency $K_i$s for symmetrical traveling salesman problem
par: Wang, Yong
Publié: (2025)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
par: Büngener, Aaron, et autres
Publié: (2024)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
par: Abbasizanjani, Hoda, et autres
Publié: (2020)

Loop unrolling of UCA models: distance labeling
par: Soulignac, Francisco J, et autres
Publié: (2022)

Shared Processor Scheduling of Multiprocessor Jobs
par: Dereniowski, Dariusz, et autres
Publié: (2018)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
par: Klein, Kim-Manuel, et autres
Publié: (2024)

On Strict Brambles
par: Lardas, Emmanouil, et autres
Publié: (2022)

Flipping odd matchings in geometric and combinatorial settings
par: Aichholzer, Oswin, et autres
Publié: (2025)

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
par: Babu, Anand, et autres
Publié: (2026)

On Minimum Maximal Distance-k Matchings
par: Kartynnik, Yury, et autres
Publié: (2016)

Color-Constrained Arborescences in Edge-Colored Digraphs
par: Ardra, P. S., et autres
Publié: (2025)

Graph burning: an overview of mathematical programs
par: Cajica-Maceda, Lourdes Beatriz, et autres
Publié: (2025)

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

New Results on Edge-coloring and Total-coloring of Split Graphs
par: Couto, Fernanda, et autres
Publié: (2023)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
par: Bonnet, Édouard, et autres
Publié: (2023)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

Computing parameters that generalize interval graphs using restricted modular partitions
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

On the complexity of Sandwich Problems for $M$-partitions
par: Barsukov, Alexey, et autres
Publié: (2026)

Compact Representation of Semilinear and Terrain-like Graphs
par: Cardinal, Jean, et autres
Publié: (2025)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
par: Ma, Will, et autres
Publié: (2024)

Online Bipartite Matching in the Probe-Commit Model
par: Borodin, Allan, et autres
Publié: (2023)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2025)

Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem
par: Goldberg, Noam, et autres
Publié: (2025)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
par: Chimani, Markus, et autres
Publié: (2021)

Explicit Formulas and Unimodality Phenomena for General Position Polynomials
par: Rather, Bilal Ahmad
Publié: (2026)

Measuring Ransomware Lateral Movement Susceptibility via Privilege-Weighted Adjacency Matrix Exponentiation
par: Tyagi, Satyam, et autres
Publié: (2025)

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
par: Liang, Kai
Publié: (2025)

Conflict-Free Colouring of Subsets
par: Jartoux, Bruno, et autres
Publié: (2022)