Imagen de Portada

Interdiction of minimum spanning trees and other matroid bases

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Weninger, Noah, Fukasawa, Ricardo
Formato:	Preprint
Publicado:	2024
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

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

Using random spanning trees in survivable networks design
por: Wrobel, Blazej, et al.
Publicado: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
por: Liu, Bowie, et al.
Publicado: (2025)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

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

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

Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)

Terminal Steiner tree problem : Complexity and Algorithms
por: S, Jyothish, et al.
Publicado: (2026)

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

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

Optimal hypersurface decision trees
por: He, Xi
Publicado: (2025)

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

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
por: Harada, Tsubasa
Publicado: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Circular-arc graphs and the Helly property
por: Derbisz, Jan, et al.
Publicado: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Detecting Disjoint Shortest Paths in Linear Time and More
por: Akmal, Shyan, et al.
Publicado: (2024)

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

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

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

Stability in Graphs with Matroid Constraints
por: Fomin, Fedor V., et al.
Publicado: (2024)

Generalizing Roberts' characterization of unit interval graphs
por: Martínez, Virginia Ardévol, et al.
Publicado: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
por: Kaul, Matthias, et al.
Publicado: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
por: Kakimura, Naonori, et al.
Publicado: (2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
por: Disser, Yann, et al.
Publicado: (2024)

Nearly Tight Bounds on Testing of Metric Properties
por: Bao, Yiqiao, et al.
Publicado: (2024)

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

Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
por: Bodini, Olivier, et al.
Publicado: (2024)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
por: Manna, Bubai, et al.
Publicado: (2024)

Exploring Repetitiveness Measures for Two-Dimensional Strings
por: Romana, Giuseppe, et al.
Publicado: (2024)

How to Reduce Temporal Cliques to Find Sparse Spanners
por: Angrick, Sebastian, et al.
Publicado: (2024)

On the Bidirected Cut Relaxation for Steiner Forest
por: Byrka, Jarosław, et al.
Publicado: (2024)

Independent set reconfiguration in H-free graphs
por: Bartier, Valentin, et al.
Publicado: (2024)

Counting random $k$-SAT near the satisfiability threshold
por: Chen, Zongchen, et al.
Publicado: (2024)

Approximation of Spanning Tree Congestion using Hereditary Bisection
por: Kolman, Petr
Publicado: (2024)

Reconfiguration of Multisets with Applications to Bin Packing
por: Kam, Jeffrey, et al.
Publicado: (2024)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
por: Duvignau, Romaric, et al.
Publicado: (2024)

On the compressiveness of the Burrows-Wheeler transform
por: Bannai, Hideo, et al.
Publicado: (2024)

An approximation algorithm for Maximum DiCut vs. Cut
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2024)