Login / Signup
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.
Hiroshi Eto
Takehiro Ito
Zhilong Liu
Eiji Miyano
Published in:
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2022)
Keyphrases
</>
independent set
planar graphs
max cut
maximum independent set
maximum weight
minimum weight
bipartite graph
upper bound
weighted graph
approximation algorithms
data objects
combinatorial optimization
social network analysis
distance function
parameter estimation
markov random field
worst case
dynamic programming