Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Retrieved May 24, 2026, from https://4ort.xyz/entity/lower-bounds-and-exact-algorithms-for-the-quadratic-minimum-spanning-tree-problem
MLA“Lower bounds and exact algorithms for the quadratic minimum spanning tree problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/lower-bounds-and-exact-algorithms-for-the-quadratic-minimum-spanning-tree-problem.
BibTeX@misc{4ortxyz_lower-bounds-and-exact-algorithms-for-the-quadratic-minimum-spanning-tree-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Lower bounds and exact algorithms for the quadratic minimum spanning tree problem}}, year = {2026}, url = {https://4ort.xyz/entity/lower-bounds-and-exact-algorithms-for-the-quadratic-minimum-spanning-tree-problem}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Lower bounds and exact algorithms for the quadratic minimum spanning tree problem — https://4ort.xyz/entity/lower-bounds-and-exact-algorithms-for-the-quadratic-minimum-spanning-tree-problem (retrieved 2026-05-24)
