Now showing items 1-1 of 1

    • Optimal Euclidean Non-Crossing 3-Matchings 

      VAZQUEZ CASAS, GUALBERTO (Universidad Autónoma Metropolitana (México). Unidad Azcapotzalco. Coordinación de Servicios de Información., 2017-08-29)
      Let P be a set of 3k points in the Euclidean plane. A 3-matching is a partition of P into k subsets of 3 points each, called triplets. The cost of each triplet fa; b; cg is given by minfjabj + jbcj; jbcj + jcaj; jcaj + ...