Pages that link to "Item:Q557903"
From MaRDI portal
The following pages link to Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903):
Displaying 18 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- On multi-path routing for reliable communications in failure interdependent complex networks (Q2025105) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Genetic local search and hardness of approximation for the server load balancing problem (Q2399467) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- Online Admission Control and Embedding of Service Chains (Q3460710) (← links)
- Max-independent set and the quantum alternating operator ansatz (Q5130754) (← links)
- On complexity of the bilevel location and pricing problems (Q5264760) (← links)
