Imagen de Portada

Computing and Learning on Combinatorial Data

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Zhang, Simon
Formato:	Preprint
Publicado:	2025
Materias:	Artificial Intelligence Discrete Mathematics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tightest Admissible Shortest Path
por: Weiss, Eyal, et al.
Publicado: (2023)

Query Complexity of Tournament Solutions
por: Maiti, Arnab, et al.
Publicado: (2016)

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
por: Weiss, Eyal, et al.
Publicado: (2022)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
por: Mota, Felipe O., et al.
Publicado: (2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
por: Abboud, Amir, et al.
Publicado: (2025)

Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
por: Brlek, Srečko, et al.
Publicado: (2024)

Learning to Prune Instances of Steiner Tree Problem in Graphs
por: Zhang, Jiwei, et al.
Publicado: (2022)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
por: Jordon, Addie, et al.
Publicado: (2025)

Graph Visualization for Blockchain Data
por: Dietl, Marcell, et al.
Publicado: (2024)

$σ$-Maximal Ancestral Graphs
por: Yao, Binghua, et al.
Publicado: (2025)

A Tie-breaking based Local Search Algorithm for Stable Matching Problems
por: Qiu, Junyuan
Publicado: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
por: Yau, Morris, et al.
Publicado: (2023)

Computing Treedepth Obstructions
por: Kühn, Kolja
Publicado: (2025)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
por: Chen, Yixin, et al.
Publicado: (2024)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
por: Conrado, Giovanna K., et al.
Publicado: (2023)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

A Tale of Santa Claus, Hypergraphs and Matroids
por: Davies, Sami, et al.
Publicado: (2018)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
por: Liang, Wei, et al.
Publicado: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

Approximation algorithms for non-sequential star packing problems
por: Hu, Mengyuan, et al.
Publicado: (2024)

Deterministic counting from coupling independence
por: Chen, Xiaoyu, et al.
Publicado: (2024)

Holey graphs: very large Betti numbers are testable
por: Szabó, Dániel, et al.
Publicado: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
por: Bourneuf, Romain, et al.
Publicado: (2025)

Translating between the representations of an acyclic convex geometry of bounded degree
por: Defrain, Oscar, et al.
Publicado: (2025)

Half-space separation in monophonic convexity
por: Elaroussi, Mohammed, et al.
Publicado: (2024)

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches
por: Naik, Ranjan N
Publicado: (2025)

On the enumeration of signatures of XOR-CNF's
por: Creignou, Nadia, et al.
Publicado: (2024)

Generating minimal redundant and maximal irredundant sets in incidence graphs
por: Castelo, Emanuel, et al.
Publicado: (2026)

SAT Requires Exhaustive Search
por: Xu, Ke, et al.
Publicado: (2023)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
por: Faber, Daniel, et al.
Publicado: (2024)

String Matching with a Dynamic Pattern
por: Monteiro, Bruno, et al.
Publicado: (2025)

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Graph Coloring Below Guarantees via Co-Triangle Packing
por: Akmal, Shyan, et al.
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

Approximating Submodular Matroid-Constrained Partitioning
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2025)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
por: Veldt, Nate
Publicado: (2025)

(Approximate) Matrix Multiplication via Convolutions
por: Uffenheimer, Yahel, et al.
Publicado: (2025)