For our purposes, locational analysis is the formulation and solution of location problems.
We consider locational analysis which is carried out by the construction and solution of …

The idea for this book came from the time the authors spent at the Statistics and Applied
Mathematical Sciences Institute (SAMSI) in Research Triangle Park in North Carolina …

The discussion of the fundamental p-center and p-median problems in Part I of this paper
provides the basis for the work surveyed in Part II. Part II deals with the minimax and …

Graph Theory has proved to be an extremely useful tool for solving combinatorial problems
in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

'Phylogenetics' is the reconstruction and analysis of phylogenetic (evolutionary) trees and
networks based on inherited characteristics. It is a flourishing area of intereaction between …

We prove that for every planar graph H there is a number w such that every graph with no
minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing …

Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite
optimization problems and in related convex optimization problems involving sparse positive …

Clique trees and chordal graphs have carved out a niche for themselves in recent work on
sparse matrix algorithms, due primarily to research questions associated with advanced …

Given a graph G=(V, E), a subgraph Gapos;=(V, Eapos;) is at‐spanner of G if for every u, v∈
V, the distance from u to v in Gapos; is at most t times longer than that distance in G. This …