Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
type: Item
instance of: scholarly article
title: Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
zbMATH Open document ID: 1387.90229
author: Kenjiro Takazawa
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6495/
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6872146
zbMATH Keywords: combinatorial algorithm
zbMATH Keywords: matching theory
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: restricted 2-matching
zbMATH Keywords: subtour elimination constraint
zbMATH Keywords: Hamilton-laceable graph
MaRDI profile type: Publication
OpenAlex ID: W2623472667
cites work: Matching theory
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Worst-case comparison of valid inequalities for the TSP
cites work: In Pursuit of the Traveling Salesman
cites work: Q4371290
cites work: Finding 2-factors closer to TSP tours in cubic graphs
cites work: The traveling salesman problem on cubic and subcubic graphs
cites work: TSP Tours in Cubic Graphs: Beyond 4/3
cites work: An improved upper bound for the TSP in cubic 3-edge-connected graphs
cites work: A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs
cites work: A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
cites work: Improved Approximations for Cubic Bipartite and Cubic TSP
cites work: A matching problem with side conditions
cites work: On Restricted Two-Factors
cites work: Matching, matroids, and extensions
cites work: A proof of Cunningham's conjecture on restricted subgraphs and jump systems
cites work: Q4263715
cites work: Restricted \(t\)-matchings in bipartite graphs
cites work: Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs
cites work: Finding maximum square-free 2-matchings in bipartite graphs
cites work: Combinatorial algorithms for matchings, even factors and square-free 2-factors
cites work: Improved algorithms for even factors and square-free simple \(b\)-matchings
cites work: On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
cites work: A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
cites work: Planar graph colorings without short monochromatic cycles
cites work: Cycles Intersecting Edge-Cuts of Prescribed Sizes
cites work: ${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski
cites work: Q4200086
cites work: TRIANGLE-FREE 2-MATCHINGS REVISITED
cites work: Integer Programming and Combinatorial Optimization
cites work: Q5422499
cites work: Maximal non- hamilton-laceable graphs
cites work: Q3900101
cites work: Paths, Trees, and Flowers
DOI: 10.1016/J.DISOPT.2017.05.003
description: scientific article; zbMATH DE number 6872146