Approximating the Quadratic Knapsack Problem on Special Graph Classes.
Ulrich PferschyJoachim SchauerPublished in: WAOA (2013)
Keyphrases
- equivalence classes
- graph structure
- weighted graph
- graph theoretic
- graph representation
- directed graph
- random walk
- graph theory
- knapsack problem
- directed acyclic graph
- bipartite graph
- minimum spanning tree
- graph search
- graph properties
- random graphs
- graph data
- search algorithm
- graphical representation
- graph databases
- connected components
- shortest path
- multi class
- data model
- evolutionary algorithm