Search Results - "Efficient polynomial time approximation scheme"

Parallel-batch scheduling with rejection: Structural properties and approximation algorithms by Ou, Jinwen, Lu, Lingfa, Zhong, Xueling

“… However, the number of jobs in a batch is limited. Each job can be rejected subject to a job-dependent penalty cost, but the total penalty cost of the jobs rejected is required to be no…”
Get full text

The subdivision-constrained minimum spanning tree problem by Li, Jianping, Li, Weidong, Zhang, Tongquan, Zhang, Zhongxu

“…, A. Levin, An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection, SIAM Journal on Computing 33 (2) (2004) 261–268…”
Get full text

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“…), in which a set of items of given values and weights needs to be packed into a set of bins subject to separable assignment constraints, so as to maximize the total value…”
Get full text

An EPTAS for Budgeted Matroid Independent Set by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“… independent set problem has a PTAS but does not admit an efficient polynomial-time approximation scheme (EPTAS…”
Get full text

Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters by Khachay, Michael, Neznakhina, Katherine

“…We consider the geometric version of the well-known Generalized Traveling Salesman Problem introduced in 2015 by Bhattacharya et al. that is called the…”
Get full text