Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Cut Cone, L 1 Embeddability, Complexity and Multicommodity David Avis*
 

Summary: The Cut Cone, L 1 Embeddability, Complexity and Multicommodity
Flows
David Avis*
School of Computer Science
McGill University
3480 University
Montreal, Canada, H3A 2A7
Michel Deza
CNRS, UA 212
Universite de Paris VII
17, Passage de l'industrie
750010 Paris, France
November 1990
ABSTRACT
A finite metric (or more properly semimetric) on n points is a non≠negative vector
d = (d ij ) 1 £ i < j £ n that satisfies the triangle inequality: d ij £ d ik + d jk . The L 1 (or Manhattan
)distance |
| x - y|| 1 between two vectors x = (x i ) and y = (y i ) in R m is given by
|
| x - y|| 1 =

  

Source: Avis, David - School of Computer Science, McGill University

 

Collections: Computer Technologies and Information Sciences