Login / Signup
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses.
Parinya Chalermsook
Bundit Laekhanukit
Danupon Nanongkai
Published in:
FOCS (2013)
Keyphrases
</>
independent set
maximum weight
lower bound
matching algorithm
maximum independent set
image matching
error bounds
graph matching
bipartite graph
graph theory
pattern matching
closed form
dynamic pricing
upper bound
keypoints
feature points
markov chain
computational complexity