Abstract
We study the polytope of the graph approximation problem. Some polyhedral relaxation of this polytope is built. We describe the class of valid inequalities for this polytope among which the inequalities that generate the facets are allocated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
