Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings.
Haris AngelidakisPublished in: CoRR (2018)
Keyphrases
- shortest path
- graph partitioning
- weighted graph
- shortest path problem
- worst case
- betweenness centrality
- path queries
- query processing
- finding the shortest path
- partitioning algorithm
- shortest path algorithm
- flow graph
- road network
- data objects
- graph model
- np complete
- language model
- optimization problems
- np hard
- lower bound
- shortest distance
- image segmentation