Vohra, R.V.

network graph point vertice length function theorem profile consensus function network n points p property arc uv graph g bottleneck property client consensus distance lemma result tree network cube-free location vertex proof characterization axiom cycle structure theorem b tree networks bottleneck element problem mulder consistency v-path class segment vi vi +1 | v | theory sequence theorem f permutation y 1 length 2 m definition induction version subset subnetwork paper european j interval location theory cube graph 4- cycles manhattan graph case function m network case 1 times subgraph structure theory client positions permutation use induction outcome x theorem e approach triangle-free graphs choice case k rectangle theorem 6 facility theorem 1 arc xy 2 ||. restriction