arXiv (All)
open access
Algorithms for Connected Multicuts of Weighted Trees
In the \emph{connected multicut problem for weighted trees}, the instance is an edge-weighted tree $T = (V,E,ω)$, a set of terminals $Γ\subseteq V$, and a set of pairwise ``conflicts'' between these terminals represented by edges of a conflict graph $\mathcal{C} = (Γ,\mathcal{F})$. A \emph{connected
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
- Width-Bounded Equational Derivations for Finite Graph Expressions#985689
- Data for: More bark than bite: Treehole ecosystems are resistant to hurricane disturbance#283016
- Approximation Algorithms for Graphic Multi-Depot TSP and Graphic Multi-Path TSP#1341775
- Cost Characterization of Vertically Partitioned Federated Knowledge Graphs#1071432
Record · ID 1389832
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