Login / Signup

Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.

Davide BilòLuciano GualàGuido Proietti
Published in: MFCS (2010)
Keyphrases
  • approximation algorithms
  • directed graph
  • problems involving
  • data sets
  • neural network
  • social networks
  • optimal solution
  • search algorithm
  • optimization problems
  • np complete
  • graph theory
  • shortest path problem