Copertina

Diffusion-Robust Optimization over Graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Aolaritei, Liviu, Huang, Ricky, Jordan, Michael I., Grigas, Paul
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Computational Complexity Discrete Mathematics Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Approximate Graph Colouring and the Crystal with a Hollow Shadow
di: Ciardo, Lorenzo, et al.
Pubblicazione: (2022)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
di: Roberson, David E., et al.
Pubblicazione: (2023)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
di: Cornect, Anders, et al.
Pubblicazione: (2024)

Arithmetic Circuits and Neural Networks for Regular Matroids
di: Hertrich, Christoph, et al.
Pubblicazione: (2025)

Neural Networks and (Virtual) Extended Formulations
di: Hertrich, Christoph, et al.
Pubblicazione: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
di: Figueira, José Rui, et al.
Pubblicazione: (2024)

Efficient approximation schemes for scheduling on a stochastic number of machines
di: Epstein, Leah, et al.
Pubblicazione: (2024)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
di: Diaby, Moustapha
Pubblicazione: (2016)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
di: Grüne, Christoph, et al.
Pubblicazione: (2024)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
di: Grüne, Christoph, et al.
Pubblicazione: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
di: Au, Yu Hin, et al.
Pubblicazione: (2024)

Reconfiguring Graph Homomorphisms on the Sphere
di: Lee, Jae-Baek, et al.
Pubblicazione: (2018)

Determining the Outerthickness of Graphs Is NP-Hard
di: Lee, Pin-Hsian, et al.
Pubblicazione: (2026)

The Interplay Between Domination and Separation in Graphs
di: Chakraborty, Dipayan, et al.
Pubblicazione: (2026)

Graph Irregularity via Edge Deletions
di: Bensmail, Julien, et al.
Pubblicazione: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
di: Čertík, Michal, et al.
Pubblicazione: (2025)

On Computational Aspects of Cores of Ordered Graphs
di: Čertík, Michal, et al.
Pubblicazione: (2025)

Testing Isomorphism of Graphs in Polynomial Time
di: Xue, Rui
Pubblicazione: (2023)

Finding d-Cuts in Claw-free Graphs
di: Ahn, Jungho, et al.
Pubblicazione: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
di: Concha-Vega, Pablo
Pubblicazione: (2026)

Finding Minimum Matching Cuts in $H$-free Graphs
di: Lucke, Felicia, et al.
Pubblicazione: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
di: Lucke, Felicia
Pubblicazione: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

Bond Polytope under Vertex- and Edge-sums
di: Kolman, Petr, et al.
Pubblicazione: (2026)

Sparse Approximation in Lattices and Semigroups
di: Kuhlmann, Stefan, et al.
Pubblicazione: (2024)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2023)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
di: Au, Yu Hin, et al.
Pubblicazione: (2020)

On Circuit Diameter Bounds via Circuit Imbalances
di: Dadush, Daniel, et al.
Pubblicazione: (2021)

Valid Cuts for the Design of Potential-based Flow Networks
di: Börner, Pascal, et al.
Pubblicazione: (2025)

On the complexity of the Maker-Breaker happy vertex game
di: Hilaire, Mathieu, et al.
Pubblicazione: (2026)

On the parameterized complexity of the Maker-Breaker domination game
di: Bagan, Guillaume, et al.
Pubblicazione: (2026)

A Simple Sub-Polynomial Degree Coboundary Expander
di: Hopkins, Max, et al.
Pubblicazione: (2026)

Sparse High Dimensional Expanders via Local Lifts
di: Yaacov, Inbar Ben, et al.
Pubblicazione: (2024)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
di: Bok, Jan, et al.
Pubblicazione: (2021)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
di: Nakajima, Tamio-Vesa, et al.
Pubblicazione: (2025)

Factorization norms and an inverse theorem for MaxCut
di: Balla, Igor, et al.
Pubblicazione: (2025)

Maker-Maker games of rank 4 are PSPACE-complete
di: Galliot, Florian, et al.
Pubblicazione: (2025)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
di: Bonomo-Braberman, Flavia, et al.
Pubblicazione: (2025)

Temporal Reachability Dominating Sets: contagion in temporal graphs
di: Kutner, David C., et al.
Pubblicazione: (2023)