Constrained weighted matchings and edge coverings in graphs
From MaRDI portal
(Redirected from Publication:1304484)
Recommendations
Cites work
- A 1-matching blossom-type algorithm for edge covering problems
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- An efficient algorithm for minimumk-covers in weighted graphs
- Equivalence between the minimum covering problem and the maximum matching problem
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 3989103 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- The \(k\)-cardinality assignment problem
Cited in
(31)- Fuzzy minimum weight edge covering problem
- Parameterized measure \& conquer for problems with no small kernels
- On a cardinality-constrained transportation problem with market choice
- Solving the k-cardinality assignment problem by transformation
- A constrained matching problem
- Exact algorithms for edge domination
- Approximation algorithms for the submodular edge cover problem with submodular penalties
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Maximum weight edge-constrained matchings
- The minimum cost perfect matching problem with conflict pair constraints
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Exact Algorithms for Edge Domination
- Edge covering problem under hybrid uncertain environments
- scientific article; zbMATH DE number 59833 (Why is no real title available?)
- scientific article; zbMATH DE number 4128659 (Why is no real title available?)
- A note on the weighted matching with penalty problem
- Balanced problems on graphs with categorization of edges
- A refined exact algorithm for edge dominating set
- On the transportation problem with market choice
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- A weighted perfect matching with constraints on weights of its parts
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- Some graph optimization problems with weights satisfying linear constraints
- A fuzzy model for NMT word alignment using quasi-perfect matching
- How many matchings cover the nodes of a graph?
- A unified approach to approximating partial covering problems
- Edge cover by connected bipartite subgraphs
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Partitioned matching games for international kidney exchange
- Approximation algorithms for k-scenario matching
- Parameterized algorithms for d-hitting set: the weighted case
This page was built for publication: Constrained weighted matchings and edge coverings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304484)
