Pages that link to "Item:Q4268816"
From MaRDI portal
The following pages link to Structure in Approximation Classes (Q4268816):
Displaying 27 items.
- A bilevel planning model for public-private partnership (Q276164) (← links)
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- Structural limits and approximations of mappings (Q322317) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Genetic local search and hardness of approximation for the server load balancing problem (Q2399467) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion (Q2489961) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- On the hardness of approximating the min-hack problem (Q2569170) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- On the Complexity of Wafer-to-Wafer Integration (Q2947021) (← links)
- (Q2949133) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues (Q5044399) (← links)
- On complexity of the bilevel location and pricing problems (Q5264760) (← links)
- (Q5457562) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
- Weighted automata and logics meet computational complexity (Q6647756) (← links)