Pages that link to "Item:Q290268"
From MaRDI portal
The following pages link to On the efficiency of polynomial time approximation schemes (Q290268):
Displayed 35 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Core instances for testing: a case study (Q1779532) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- Dynamic programming optimization in line of sight networks (Q2288208) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Parameterized counting problems (Q2576944) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Parameterized Complexity (Q2841253) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- (Q4500688) (← links)
- Independent Sets in Restricted Line of Sight Networks (Q5056064) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
- EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)