Matching interdiction
type: Item
instance of: scholarly article
title: Matching interdiction
zbMATH Open document ID: 1208.05120
author: Rico Zenklusen
published in: Discrete Applied Mathematics
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5810763
zbMATH Keywords: maximum matching
zbMATH Keywords: interdiction
zbMATH Keywords: complexity
zbMATH Keywords: approximation algorithm
zbMATH Keywords: bounded treewidth
MaRDI profile type: Publication
full work available at URL: j.dam.2010.06.006
OpenAlex ID: W2915069302
cites work: Finding the most vital arcs in a network
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
cites work: Q4452913
cites work: NP-completeness results for edge modification problems
cites work: The 0-1 inverse maximum stable set problem
cites work: Q4875228
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: A problem in network interdiction
cites work: Shortest-path network interdiction
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
cites work: Treewidth. Computations and approximations
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: The most vital edges in the minimum spanning tree problem
cites work: Complexity classification of some edge modification problems
cites work: The network inhibition problem
cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Deterministic network interdiction
cites work: Edge-Deletion Problems
cites work: Node-Deletion Problems on Bipartite Graphs
cites work: Network flow interdiction on planar graphs
cites work: Blockers and transversals
DOI: 10.1016/J.DAM.2010.06.006
description: scientific article; zbMATH DE number 5810763