logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A constrained minimum spanning tree problem

delete2000-08-01
delete8
PRE
AI
陈
陈光亭 (Guangting Chen) *
张
张国川 (Guochuan Zhang)
DOI：10.1016/S0305-0548(99)00061-1delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we give an O(n(2)) algorithm for finding a point on a given line I which, if added to a given set of n points located on one side of l, will result in the minimum spanning tree.
Keywords:
spanning tree
divide-and-conquer
algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available