A simple algorithm to optimize maximum

MaRDI QIDQ2792975zbMATH OpenFDO

Authors S. Balaji, V. Swaminathan, K. Kannan

Publication date 14 March 2016

Published in Advanced Modeling and Optimization (Search for Journal in Brave)

Full work available at URL http://camo.ici.ro/journal/vol12/v12a9.pdf

zbMATH Keywords

algorithmsindependent setvertex coverNP-hard problemvertex support

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Integer programming (90C10)

Recommendations

• A new heuristic algorithm to solve the maximum independent set problem
• Extending the MAX algorithm for maximum independent set
• Algorithms for maximum independent sets
• An algorithm for finding a maximum weighted independent set in an arbitrary graph
• Heuristic algorithm for finding the maximum independent set

Cited in

(8)

• Extending the MAX algorithm for maximum independent set
• Maximum independent sets and supervised learning
• A polytime preprocess algorithm for the maximum independent set problem
• Heuristic algorithm for finding the maximum independent set
• Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
• A new heuristic algorithm to solve the maximum independent set problem
• An independent set approach for the communication network of the GPS III system
• A Simplified IDEA Algorithm

This page was built for publication: A simple algorithm to optimize maximum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2792975)