arXiv (All)
open access
Minimum Spanning Trees for Square Crop Plots
Motivated by accessing crop plots in a field, where each crop plot can only be visited by a given pair of entry/exit points (we have three different types, each having four cases), we study the corresponding Minimum Spanning Tree (MST) problem of such a planar set of axis-aligned unit squares. It tu
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
- A 2.37332-Competitive Algorithm for Online Square Packing with Gravity#997016
- Directed distances in spanning-tree-decorated planar maps: exact exponent, scaling limit and universality#1037197
- Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection#267621
- Minimizing cumulative infections in SIS epidemic models over networks via an edge deletion algorithm#1141583
- Replication Data for: Drivers of farmers’ decisions to adopt agroforestry: Evidence from the Sudanian savanna zone, Burkina Faso#1028062
Record · ID 1155742
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