Imagen de Portada

Inverse matroid optimization under subset constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Soto, José
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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)

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

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

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

Interdiction of minimum spanning trees and other matroid bases
por: Weninger, Noah, et al.
Publicado: (2024)

On the sizes of BDDs and ZDDs representing matroids
por: Emoto, Hiromi, et al.
Publicado: (2024)

Sorting with constraints
por: Manas, A.
Publicado: (2025)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
por: Tan, Jingjing
Publicado: (2024)

All ascents exponential from valued constraint graphs of pathwidth three
por: Kaznatcheev, Artem, et al.
Publicado: (2026)

Continuous optimization methods for the graph isomorphism problem
por: Klus, Stefan, et al.
Publicado: (2023)

Parameterized Complexity of Submodular Minimization under Uncertainty
por: Kakimura, Naonori, et al.
Publicado: (2024)

Faster algorithms on linear delta-matroids
por: Koana, Tomohiro, et al.
Publicado: (2024)

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
por: Klimm, Max, et al.
Publicado: (2022)

Tight Paths and Tight Pairs in Weighted Directed Graphs
por: Balcázar, José Luis
Publicado: (2025)

Traversing combinatorial 0/1-polytopes via optimization
por: Merino, Arturo, et al.
Publicado: (2023)

Efficient space reduction techniques by optimized majority rules for the Kemeny aggregation problem and beyond
por: Phung, Xuan Kien, et al.
Publicado: (2025)

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

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
por: Jordon, Addie, 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)

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)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
por: Arhire, Andrei, et al.
Publicado: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
por: Foucaud, Florent, et al.
Publicado: (2025)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Source-Oblivious Broadcast
por: Fraigniaud, Pierre, et al.
Publicado: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
por: Chaudhary, Juhi, et al.
Publicado: (2025)

When does FTP become FPT?
por: Bentert, Matthias, et al.
Publicado: (2025)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
por: Gaikwad, Ajinkya
Publicado: (2025)

Testing Quasiperiodicity
por: Awofeso, Christine, et al.
Publicado: (2025)

Functional design of efficient and parallelizable combinatorial generators using convolution
por: He, Xi, et al.
Publicado: (2025)

Unsplittable Cost Flows from Unweighted Error-Bounded Variants
por: Swamy, Chaitanya, et al.
Publicado: (2025)

H-Planarity and Parametric Extensions: when Modulators Act Globally
por: Fomin, Fedor V., et al.
Publicado: (2025)

An Exact Solver for Submodular Knapsack Problems
por: Münch, Sabine, et al.
Publicado: (2025)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
por: Soulignac, Francisco J.
Publicado: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
por: Ueta, Keisuke, et al.
Publicado: (2025)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)