Imagen de Portada

Matroid Intersection under Minimum Rank Oracle

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bárász, Mihály, Bérczi, Kristóf, Király, Tamás, Oki, Taihei, Yamaguchi, Yutaro, Yokoi, Yu
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Problems on Group-labeled Matroid Bases
por: Hörsch, Florian, et al.
Publicado: (2024)

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

Multiway Cuts with a Choice of Representatives
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
por: Bai, Yuhang, et al.
Publicado: (2026)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Odd and Even Harder Problems on Cycle-Factors
por: Hörsch, Florian, et al.
Publicado: (2025)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Splitting-off in Hypergraphs
por: Bérczi, Kristóf, et al.
Publicado: (2023)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
por: Murakami, Hitoshi, et al.
Publicado: (2024)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
por: Norose, Ryoma, et al.
Publicado: (2024)

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
por: Kano, Takumi, et al.
Publicado: (2026)

Matroid Secretary via Labeling Schemes
por: Bérczi, Kristóf, et al.
Publicado: (2024)

The Rainbow Arborescence Problem on Cycles
por: Bérczi, Kristóf, et al.
Publicado: (2025)

A new approach to bipartite stable matching optimization
por: Fleiner, Tamás, et al.
Publicado: (2024)

Fractional Linear Matroid Matching is in quasi-NC
por: Gurjar, Rohit, et al.
Publicado: (2024)

Exact Matching in Matrix Multiplication Time
por: Sato, Ryotaro, et al.
Publicado: (2025)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
por: Lee, Euiwoong, et al.
Publicado: (2024)

Algorithmic aspects of semistability of quiver representations
por: Iwamasa, Yuni, et al.
Publicado: (2024)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
por: Oki, Taihei, et al.
Publicado: (2026)

Space Complexity of Vertex Connectivity Oracles
por: Pettie, Seth, et al.
Publicado: (2022)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
por: Oki, Taihei, et al.
Publicado: (2024)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
por: Izumi, Taisuke, et al.
Publicado: (2023)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
por: Izumi, Taisuke, et al.
Publicado: (2025)

Cuts in Graphs with Matroid Constraints
por: Banik, Aritra, et al.
Publicado: (2024)

Paths and Intersections: Exact Emulators for Planar Graphs
por: Li, George Z., et al.
Publicado: (2025)

Deterministic $(2/3-\varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
por: Terao, Tatsuya
Publicado: (2024)

Finding the diameter of a tree with distance queries
por: Gerbner, Dániel, et al.
Publicado: (2025)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
por: Arndt, Stephen, et al.
Publicado: (2025)

Approximating maximum properly colored forests via degree bounded independent sets
por: Bai, Yuhang, et al.
Publicado: (2025)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
por: Glover, Charles N.
Publicado: (2024)

Computational Complexity of Swish
por: Horiyama, Takashi, et al.
Publicado: (2026)

Faster Approximate Linear Matroid Intersection
por: Terao, Tatsuya
Publicado: (2026)

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

A Weighted-to-Unweighted Reduction for Matroid Intersection
por: Dudeja, Aditi, et al.
Publicado: (2026)

A Fast Coloring Oracle for Average Case Hypergraphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
por: Chen, Yu, et al.
Publicado: (2024)