Pages that link to "Item:Q3581485"
From MaRDI portal
The following pages link to Confronting hardness using a hybrid approach (Q3581485):
Displaying 13 items.
- Algorithm portfolios for noisy optimization (Q276539) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
