Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.
Yun Kuen CheungGramoz GoranciMonika HenzingerPublished in: ICALP (2016)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- upper and lower bounds
- valid inequalities
- lagrangian relaxation
- random walk
- structured data
- distance measure
- directed graph
- graph matching
- weighted graph
- bipartite graph
- graph representation
- graph theory
- graph structure
- graph mining
- euclidean distance
- data structure
- branch and bound
- itemsets
- lagrangian dual