Pages that link to "Item:Q3477970"

The following pages link to On Approximate Solutions for Combinatorial Optimization Problems (Q3477970):

Displaying 29 items.

• Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
• Property testing of the Boolean and binary rank (Q825974) (← links)
• An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
• Time slot scheduling of compatible jobs (Q880586) (← links)
• The 0-1 inverse maximum stable set problem (Q955316) (← links)
• Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583) (← links)
• A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem (Q1195856) (← links)
• Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
• On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
• Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
• Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
• On subexponential and FPT-time inapproximability (Q2343081) (← links)
• Chromatic characterization of biclique covers (Q2368922) (← links)
• Reductions, completeness and the hardness of approximability (Q2488898) (← links)
• On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
• On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
• Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q3541795) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
• The approximation of maximum subgraph problems (Q4630247) (← links)
• Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
• Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)