arXiv (All)
open access
An Algorithm for Linear Parametric Minimum Cycle Mean Problem
The minimum cycle mean problem (MCM) on weighted digraphs is the problem of finding the minimum value of the cycle mean, that is, the ratio of the cost to the length, over all cycles. Despite its wide range of applications to discrete event systems, the parametric counterpart of the MCM has received
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Combinatorial optimization model, approximation and heuristic algorithms for identifying specific structures in networks#1066242
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#423920
- Conjugating full cycles by adjacent transpositions: diameter and sorting time#925898
- Distributed Algorithms for Near-Equitable Coloring#429339
- Distributed Near-Equitable Coloring in the LOCAL Model#1062091
Record · ID 1077163
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive