A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.

Anna Adamaszek Andreas Wiese

Published in: SODA (2014)

Keyphrases

independent set
maximum weight
minimum weight
weighted graph
bipartite graph
bipartite matching
spanning tree
maximum independent set
minimum length
greedy heuristic
partial order
edge weights
minimum spanning tree
np hard
evolutionary algorithm
tree patterns
shortest path
segmentation algorithm