Co-density and fractional edge cover packing

DOI10.1007/s10878-020-00535-xzbMath1442.90172OpenAlexW3004630091MaRDI QIDQ2175043

Jiajun Sang, Zhibin Chen, Qiu-Lan Zhao

Publication date: 27 April 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00535-x

zbMATH Keywords

multigraphedge covercombinatorial algorithmfractional packingco-density

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (1)

On Gupta’s Codensity Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• The complexity of recognizing linear systems with certain integrality properties
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Minimizing submodular functions over families of sets
• A new approach to the maximum-flow problem
• Multi-Terminal Network Flows
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• On the chromatic index and the cover index of a multigraph
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Densities, Matchings, and Fractional Edge-Colorings
• Paths, Trees, and Flowers
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Co-density and fractional edge cover packing