On the public citation graph
Polynomially bounded algorithms for locatingp-centers on a tree
0 signed · 83 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01584085openalex-snapshot
Blocking and anti-blocking pairs of polyhedra
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1137/0137040openalex-snapshot
An Algorithmic Approach to Network Location Problems. I: The p -Centers
inferredcites →https://doi.org/10.1137/0137041openalex-snapshot
An Algorithmic Approach to Network Location Problems. II: The p -Medians
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1287/opre.12.3.450openalex-snapshot
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
inferredcites →https://doi.org/10.1287/trsc.11.3.243openalex-snapshot
A Min-Max Theorem for p-Center Problems on a Tree
inferredcites →https://doi.org/10.1287/trsc.12.2.93openalex-snapshot
Finding Two-Centers of a Tree: The Continuous Case
inferredcites →https://doi.org/10.1287/trsc.6.4.407openalex-snapshot
Minimax Location of a Facility in a Network
inferredcites →https://doi.org/10.1287/trsc.7.3.287openalex-snapshot
Minimax Location of a Facility in an Undirected Tree Graph
inferredcites →https://doi.org/10.1287/trsc.8.4.333openalex-snapshot
A Minimax Location Problem on a Network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_331openalex-snapshot
Network Location: Covering Problems
inferred← citeshttps://doi.org/10.1007/3-540-36265-7_32openalex-snapshot
An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_39openalex-snapshot
On domination elimination orderings and domination graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_438openalex-snapshot
Network Location: Covering Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-38310-6_2openalex-snapshot
The Origins of Discrete Diversity
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_10openalex-snapshot
One-Dimensional k-Center on Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_18openalex-snapshot
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_8openalex-snapshot
Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_22openalex-snapshot
From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems
inferred← citeshttps://doi.org/10.1007/bf01840381openalex-snapshot
Efficient parallel algorithms forr-dominating set andp-center problems on trees
inferred← citeshttps://doi.org/10.1007/bf03008914openalex-snapshot
Computation of a (canonical) doubly perfect elimination ordering of a doubly chordal graph
inferred← citeshttps://doi.org/10.1007/bf03008936openalex-snapshot
Some characterizations of doubly chordal graphs
inferred← citeshttps://doi.org/10.1007/bfb0028271openalex-snapshot
Parametric search and locating supply centers in trees
inferred← citeshttps://doi.org/10.1007/s10115-021-01601-4openalex-snapshot
Improvements on approximation algorithms for clustering probabilistic data
inferred← citeshttps://doi.org/10.1007/s10878-017-0213-2openalex-snapshot
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00013-0openalex-snapshot
New linear time algorithms for generating perfect elimination orderings of chordal graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90008-8openalex-snapshot
Some aspects of perfect elimination orderings in chordal graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90056-3openalex-snapshot
Some aspects of the semi-perfect elimination
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90035-4openalex-snapshot
Finding kth paths and p-centers by generating and searching good data structures
inferred← citeshttps://doi.org/10.1016/0272-6963(85)90032-4openalex-snapshot
Comparison of exact and approximate methods of solving the uncapacitated plant location problem
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90420-7openalex-snapshot
Analytical models for locating undesirable facilities
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90297-oopenalex-snapshot
The discrete p-dispersion problem
inferred← citeshttps://doi.org/10.1016/0966-8349(95)98315-iopenalex-snapshot
Solving structured multifacility location problems efficiently
inferred← citeshttps://doi.org/10.1016/j.cor.2006.05.003openalex-snapshot
The 1-center problem in the plane with independent random weights
inferred← citeshttps://doi.org/10.1016/j.cor.2010.12.002openalex-snapshot
Bee colony optimization for the p-center problem
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.004openalex-snapshot
Finding the conditional location of a median path on a tree
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.06.011openalex-snapshot
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106498openalex-snapshot
Dispersion problem on a convex polygon
inferred← citeshttps://doi.org/10.1016/j.orl.2016.03.009openalex-snapshot
A note on computing the center of uncertain data on the real line
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.028openalex-snapshot
Efficient algorithms for the one-dimensional k-center problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.017openalex-snapshot
One-dimensional k-center on uncertain data
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00198-6openalex-snapshot
Perfect edge domination and efficient edge domination in graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00464-2openalex-snapshot
Dominant, an algorithm for the p-center problem
inferred← citeshttps://doi.org/10.1016/s0966-8349(96)00012-5openalex-snapshot
The p-center location problem in an area
inferred← citeshttps://doi.org/10.1023/a:1018901523519openalex-snapshot
A unified limited column generation approach for facility location problems ontrees
inferred← citeshttps://doi.org/10.1080/00207160512331323380openalex-snapshot
Genetic algorithm to solve thep-centre andp-radius problem on a network
inferred← citeshttps://doi.org/10.1080/19427867.2021.1909797openalex-snapshot
Finding the absolute and vertex center of a fuzzy tree
inferred← citeshttps://doi.org/10.1109/12.5979openalex-snapshot
NC algorithms for recognizing chordal graphs and k trees
inferred← citeshttps://doi.org/10.1109/icdm50108.2020.00009openalex-snapshot
Approximation Algorithms for Probabilistic k-Center Clustering
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183387openalex-snapshot
Efficient parallel algorithms for the r-dominating set and p-center problems on trees
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183403openalex-snapshot
An improved algorithm for finding k-centrums on weighted trees
inferred← citeshttps://doi.org/10.1109/ipps.1992.223063openalex-snapshot
Efficient parallel algorithms for selection and searching on sorted matrices
inferred← citeshttps://doi.org/10.1109/tpds.2004.36openalex-snapshot
Finding r-dominating sets and p-centers of trees in parallel
inferred← citeshttps://doi.org/10.1111/gean.12392openalex-snapshot
An Efficient Solving Approach for the p‐Dispersion Problem Based on the Distance‐Based Spatially Informed Property
inferred← citeshttps://doi.org/10.1111/j.1538-4632.1987.tb00133.xopenalex-snapshot
Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems
inferred← citeshttps://doi.org/10.1137/0213002openalex-snapshot
Generalized Selection and Ranking: Sorted Matrices
inferred← citeshttps://doi.org/10.1137/0604036openalex-snapshot
A Class of Balanced Matrices Arising from Location Problems
inferred← citeshttps://doi.org/10.1137/18m1196522openalex-snapshot
An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
inferred← citeshttps://doi.org/10.1145/3196959.3196969openalex-snapshot
Improvements on the k-center Problem for Uncertain Data
inferred← citeshttps://doi.org/10.1145/800141.804690openalex-snapshot
Generalized selection and ranking (Preliminary Version)
inferred← citeshttps://doi.org/10.1155/2014/824196openalex-snapshot
A Modified Artificial Bee Colony Algorithm for p -Center Problems
inferred← citeshttps://doi.org/10.1287/mnsc.29.4.498openalex-snapshot
State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
inferred← citeshttps://doi.org/10.1287/mnsc.30.3.290openalex-snapshot
An Analysis of Network Location Problems with Distance Constraints
inferred← citeshttps://doi.org/10.1287/opre.30.4.725openalex-snapshot
Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
inferred← citeshttps://doi.org/10.1287/trsc.27.1.81openalex-snapshot
On the Core of Cost Allocation Games Defined on Location Problems
inferred← citeshttps://doi.org/10.1287/trsc.28.2.104openalex-snapshot
Solving Structured Multifacility Location Problems Efficiently
inferred← citeshttps://doi.org/10.1287/trsc.28.2.167openalex-snapshot
Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
inferred← citeshttps://doi.org/10.22111/ijfs.2008.313openalex-snapshot
THE P-CENTER PROBLEM ON FUZZY NETWORKS AND REDUCTION OF COST
inferred← citeshttps://doi.org/10.26076/b2a2-485aopenalex-snapshot
Geometric Facility Location Problems on Uncertain Data
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7512openalex-snapshot
Efficient Algorithms for One-Dimensional k-Center Problems
inferred← citeshttps://doi.org/10.5555/127787.127822openalex-snapshot
Optimal algorithms for tree partitioning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.