The minimum clique routing problem on cycles

DOI10.1002/NET.22277MaRDI QIDQ6971575zbMATH OpenFDO

Authors Mariana S. Escalante, P. Tolomei, Martin Matamala, Ivan Rapaport, Luis M. Torres

Publication date 13 June 2025

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22277

zbMATH Keywords

algorithmscombinatorial optimizationring networksrouting problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites work

• AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
• Edge-disjoint paths in planar graphs
• Geometric algorithms and combinatorial optimization
• Graph minors. XIII: The disjoint paths problem
• scientific article; zbMATH DE number 5899246 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• New hardness results for congestion minimization and machine scheduling
• On the Computational Complexity of Combinatorial Problems
• The disjoint paths problem in quadratic time
• The edge-disjoint paths problem is NP-complete for series-parallel graphs

This page was built for publication: The minimum clique routing problem on cycles

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