Login / Signup

Improved approximability and non-approximability results for graph diameter decreasing problems.

Davide BilòLuciano GualàGuido Proietti
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • directed graph
  • solving problems
  • information systems
  • evolutionary algorithm
  • random walk
  • decision problems
  • benchmark problems
  • graph model
  • graph representation