Generalizing the induced matching by edge capacity constraints

Authors:
Takuro Fukunaga;Hiroshi Nagamochi
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
Discrete Optimization
Year:
2007

Citing 11
Cited 0

A polynomial algorithm for b-matchings: an alternative approach

Information Processing Letters
Minimum edge dominating sets

SIAM Journal on Discrete Mathematics
Irredundancy in circular arc graphs

Discrete Applied Mathematics
Approximating the tree and tour covers of a graph

Information Processing Letters
Edge domination on bipartite permutation graphs and cotriangulated graphs

Information Processing Letters
New results on induced matchings

Discrete Applied Mathematics
A 2-approximation algorithm for the minimum weight edge dominating set problem

Discrete Applied Mathematics
Edge dominating and hypomatchable sets

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Induced Matchings in Regular Graphs and Trees

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A polynomial time algorithm for strong edge coloring of partial k-trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an edge-weighted graph, the induced matching problem is an edge packing problem, which asks to find a maximum weight edge set such that every edge in the graph is adjacent to at most one edge in the set. In this paper, we generalize this problem by introducing edge capacities and propose an approximation algorithm to the problem. The analysis of this algorithm is based on a relationship between two polytopes for an LP relaxation of the above problem and the capacitated b-matching problem.