K 1,4 -free graphs with independent claw centers and a certain neighborhood property concerning the endvertices of the induced claws are proved to be pancyclic or Hamiltonian, depending on which of three different properties concerning induced modified claws they meet.Expand

This chapter describes approaches to find polynomial time algorithms that compute approximate solutions to various geometric optimizations problems in Euclidean metric spaces.Expand