Maximal Direct Covering Tree Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (35)
On the shortest spanning subtree of a graph and the traveling salesman problem
1956 • 4,806 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
Multiobjective Programming and Planning
1978 • 2,045 citations
THE MAXIMAL COVERING LOCATION PROBLEM
1974 • 1,824 citations
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
1971 • 1,764 citations
The Location of Emergency Service Facilities
1971 • 1,751 citations
The Traveling-Salesman Problem and Minimum Spanning Trees
1970 • 1,431 citations
Minimum Spanning Trees and Single Linkage Cluster Analysis
1969 • 1,212 citations
Multi-Terminal Network Flows
1961 • 959 citations
Steiner Minimal Trees
1968 • 937 citations
Matroids and the greedy algorithm
1971 • 879 citations
What Is Mathematics
1941 • 657 citations
Finding Minimum Spanning Trees
1976 • 425 citations
Reconstruction of evolutionary trees
2018 • 307 citations
On the Problem of Steiner
1961 • 277 citations
Optimum Communication Spanning Trees
1974 • 269 citations
Sur la liaison et la division des points d'un ensemble fini
1951 • 237 citations
OPTIMAL LOCATION UNDER TIME OR DISTANCE CONSTRAINTS
1972 • 169 citations
The maximum covering/shortest path problem: A multiobjective network design and routing formulation
1985 • 142 citations
The hierarchical network design problem
1986 • 112 citations
DYNAMIC LOCATION MODELING FOR PUBLIC‐SECTOR FACILITIES: A MULTICRITERIA APPROACH*
1980 • 109 citations
Locating Central Paths in a Graph
1982 • 94 citations
The Generation of Minimal Trees with a Steiner Topology
1972 • 80 citations
Computing minimum spanning trees efficiently
1972 • 72 citations
Integrated System Identification and Optimization
1973 • 69 citations
Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
1957 • 68 citations
SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER
1984 • 56 citations
An algorithm for the steiner problem in graphs
1982 • 50 citations
A good algorithm for smallest spanning trees with a degree constraint
1978 • 45 citations
Multiobjective design of transportation networks
1983 • 39 citations
Physical Clusters, Surface Tension, and Critical Phenomena
1967 • 38 citations
Spanning tree manipulation and the travelling salesman problem
1968 • 23 citations
Constructing a minimal‐cost spanning tree subject to resource constraints and flow requirements
1983 • 11 citations
A Cost Analysis of Minimum Distance TV Networking for Broadcasting Medical Information.
1970 • 6 citations
Deleted Work
1955 • 0 citations