Image de couverture de livre

Matroid Intersection under Minimum Rank Oracle

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bárász, Mihály, Bérczi, Kristóf, Király, Tamás, Oki, Taihei, Yamaguchi, Yutaro, Yokoi, Yu
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

Finding Spanning Trees with Perfect Matchings
par: Bérczi, Kristóf, et autres
Publié: (2024)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

Approximating Submodular Matroid-Constrained Partitioning
par: Bérczi, Kristóf, et autres
Publié: (2025)

Multiway Cuts with a Choice of Representatives
par: Bérczi, Kristóf, et autres
Publié: (2024)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
par: Bai, Yuhang, et autres
Publié: (2026)

Approximating maximum-size properly colored forests
par: Bai, Yuhang, et autres
Publié: (2024)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
par: Bérczi, Kristóf, et autres
Publié: (2025)

Odd and Even Harder Problems on Cycle-Factors
par: Hörsch, Florian, et autres
Publié: (2025)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
par: Bérczi, Kristóf, et autres
Publié: (2024)

Splitting-off in Hypergraphs
par: Bérczi, Kristóf, et autres
Publié: (2023)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
par: Murakami, Hitoshi, et autres
Publié: (2024)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
par: Norose, Ryoma, et autres
Publié: (2024)

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
par: Kano, Takumi, et autres
Publié: (2026)

Matroid Secretary via Labeling Schemes
par: Bérczi, Kristóf, et autres
Publié: (2024)

The Rainbow Arborescence Problem on Cycles
par: Bérczi, Kristóf, et autres
Publié: (2025)

A new approach to bipartite stable matching optimization
par: Fleiner, Tamás, et autres
Publié: (2024)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

Exact Matching in Matrix Multiplication Time
par: Sato, Ryotaro, et autres
Publié: (2025)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
par: Lee, Euiwoong, et autres
Publié: (2024)

Algorithmic aspects of semistability of quiver representations
par: Iwamasa, Yuni, et autres
Publié: (2024)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
par: Oki, Taihei, et autres
Publié: (2026)

Space Complexity of Vertex Connectivity Oracles
par: Pettie, Seth, et autres
Publié: (2022)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
par: Oki, Taihei, et autres
Publié: (2024)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
par: Izumi, Taisuke, et autres
Publié: (2023)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
par: Izumi, Taisuke, et autres
Publié: (2025)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

Paths and Intersections: Exact Emulators for Planar Graphs
par: Li, George Z., et autres
Publié: (2025)

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

Finding the diameter of a tree with distance queries
par: Gerbner, Dániel, et autres
Publié: (2025)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
par: Arndt, Stephen, et autres
Publié: (2025)

Approximating maximum properly colored forests via degree bounded independent sets
par: Bai, Yuhang, et autres
Publié: (2025)

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

Computational Complexity of Swish
par: Horiyama, Takashi, et autres
Publié: (2026)

Faster Approximate Linear Matroid Intersection
par: Terao, Tatsuya
Publié: (2026)

Inverse matroid optimization under subset constraints
par: Bérczi, Kristóf, et autres
Publié: (2025)

A Weighted-to-Unweighted Reduction for Matroid Intersection
par: Dudeja, Aditi, et autres
Publié: (2026)

A Fast Coloring Oracle for Average Case Hypergraphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
par: Chen, Yu, et autres
Publié: (2024)