The bounded cycle-cover problem

DOI10.1287/IJOC.13.2.104.10516zbMATH Open1238.90131OpenAlexW2036247514MaRDI QIDQ2884498FDOQ2884498

Authors: Dorit S. Hochbaum, Eli V. Olinick 

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ce6441bc128d0c128afd40562ec3c478f781cadd

Recommendations

• Covering a graph with cycles.
• An optimal strategy for the constrained cycle cover problem
• An optimal strategy for the Constrained Cycle Cover Problem
• Constrained Cycle Covers in Halin Graphs
• STACS 2005

zbMATH Keywords

analysis of algorithmsnetworks-graphs heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (12)

• An overview of graph covering and partitioning
• An optimal strategy for the constrained cycle cover problem
• An optimal strategy for the Constrained Cycle Cover Problem
• On Approximating Restricted Cycle Covers
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• On DRC covering -- a survey
• Covering a graph with cycles.
• Lane covering with partner bounds in collaborative truckload transportation procurement
• Bounded Cycle Synthesis
• Profitable mixed capacitated arc routing and related problems
• Title not available (Why is that?)
• Constrained Cycle Covers in Halin Graphs

This page was built for publication: The bounded cycle-cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884498)