scholarly journals Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs

2020 ◽  
pp. 2260-2278
Author(s):  
Maria Chudnovsky ◽  
Marcin Pilipczuk ◽  
Michał Pilipczuk ◽  
Stéphan Thomassé
Keyword(s):  
Polynomial Time ◽  
Independent Set ◽  
Approximation Schemes ◽  
Maximum Weight ◽  
Independent Set Problem ◽  
Time Approximation ◽  
Maximum Weight Independent Set ◽  
Polynomial Time Approximation

scholarly journals New Instances for Maximum Weight Independent Set From a Vehicle Routing Application

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Yuanyuan Dong ◽  
Andrew V. Goldberg ◽  
Alexander Noe ◽  
Nikos Parotsidis ◽  
Mauricio G. C. Resende ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Independent Set ◽  
Maximum Weight ◽  
Routing Problem ◽  
Independent Set Problem ◽  
Maximum Weight Independent Set ◽  
Large Size

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.

Polynomial-Time Approximation Schemes for Circle Packing Problems

2014 ◽  
pp. 713-724 ◽  
Author(s):  
Flávio K. Miyazawa ◽  
Lehilton L. C. Pedrosa ◽  
Rafael C. S. Schouery ◽  
Maxim Sviridenko ◽  
Yoshiko Wakabayashi
Keyword(s):  
Polynomial Time ◽  
Circle Packing ◽  
Approximation Schemes ◽  
Packing Problems ◽  
Time Approximation ◽  
Polynomial Time Approximation
Sign in / Sign up

Export Citation Format

Share Document