On the complexity of approximating the independent set problem

Author(s):  
Piotr Berman ◽  
Georg Schnitger
2004 ◽  
Vol 32 (1) ◽  
pp. 23-26 ◽  
Author(s):  
Tamás Fleiner ◽  
András Frank ◽  
Satoru Iwata

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Yuanyuan Dong ◽  
Andrew V. Goldberg ◽  
Alexander Noe ◽  
Nikos Parotsidis ◽  
Mauricio G. C. Resende ◽  
...  

AbstractWe present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.


Sign in / Sign up

Export Citation Format

Share Document