ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Given a weighted graph G=(V,E,w)G=(V,E,w), where w:E→R≥0w:E\to\mathbb{R}_{\ge 0}, find an integral cycle basis B\mathcal{B} minimizing its total weight ∑C∈B∑e∈Cw(e)\sum_{C\in\mathcal{B}}\sum_{e\in C}w(e). Here an integral cycle basis is a basis of the integer cycle lattice of GG, equivalently, a cycle basis whose cycle vectors form a Z\mathbb{Z}-basis of that lattice. Determine the computational complexity of this optimization problem and characterize the graphs for which minimum cycle bases are integral for every edge-weight function.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.