arXiv (All)open access
Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees
optimization and control, discrete mathematics, data structures and algorithms, 90c27, 90b80, 90c39, 90c11, 05c85, g.2.2; g.1.6
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Record · ID 662086
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.