Search results
From MaRDI portal
- Klaus Jansen (section Research outcomes over time)Paper Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs 2005-10-28 Paper Polynomial-Time Approximation Schemes for Geometric...10 bytes (16 words) - 02:53, 9 December 2023
- Leah Epstein (section Research outcomes over time)Universal Sequencing on a Single Machine 2010-06-22 Paper Asymptotic fully polynomial approximation schemes for variants of open-end bin packing 2010-06-09 Paper...10 bytes (16 words) - 00:17, 9 December 2023
- Asaf Levin (section Research outcomes over time)Universal Sequencing on a Single Machine 2010-06-22 Paper Asymptotic fully polynomial approximation schemes for variants of open-end bin packing 2010-06-09 Paper...10 bytes (16 words) - 11:57, 7 October 2023
- problem; bin packing; asymptotic fully polynomial time approximation scheme (AFPTAS); fully polynomial time approximation scheme (FPTAS); knapsack problem...15 bytes (98 words) - 07:23, 30 January 2024
