17 pages matching length in this book
Results 1-3 of 17
What people are saying - Write a review
We haven't found any reviews in the usual places.
adjacent vertices ALGOL ALGOL 60 algorithm to solve assume BT(t Ca&e Chapter chordal graph client clique problem containing corresponding cycle decision problem defined deleted denote edge efficient points endpoint equivalent facilities located Farkas feasible solution formulated given by Figure graph G graph theory Hence independent set induced induced subgraph inequalities intersection matrix iteration J.H. van Lint J.W. de Bakker KOLEN Lemma length linear location theory longest path Mathematisch Centrum matrix of neighborhood maximum transportation cost minimal mutual communication NE(B neighborhood subtrees versus nest row NP-complete NP-hard number of facilities NW(B old BT(v(t optimum value p-median problem perfect scheme permutation polynomial problem with mutual PROOF prove rectilinear distance round-trip p-center problem row intersection graph served within distance set covering problem set of efficient shortest path standard greedy form submatrix subtrees versus vertices THEOREM totally-balanced matrix transformed into standard vector