Pages that link to "Item:Q1152215"

The following pages link to Non deterministic polynomial optimization problems and their approximations (Q1152215):

Displaying 42 items.

• Finding approximate and constrained motifs in graphs (Q390871) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
• Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
• Path-driven orientation of mixed graphs (Q479025) (← links)
• Correcting gene tree by removal and modification: tractability and approximability (Q491623) (← links)
• Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
• On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
• Completeness in approximation classes (Q811119) (← links)
• Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
• Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
• Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
• On different approximation criteria for subset product problems (Q1076608) (← links)
• On the complexity of approximating the independent set problem (Q1184733) (← links)
• Optimization, approximation, and complexity classes (Q1186548) (← links)
• A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
• Quantifiers and approximation (Q1208413) (← links)
• New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
• On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
• Parameterized (in)approximability of subset problems (Q1785218) (← links)
• Max NP-completeness made easy (Q1960655) (← links)
• Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
• The complexity of finding temporal separators under waiting time constraints (Q2059911) (← links)
• On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
• MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
• \(K\)-adaptability in stochastic optimization (Q2097652) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Complexity and algorithms for MUL-tree pruning (Q2115868) (← links)
• Parameterized domination in circle graphs (Q2441539) (← links)
• Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
• Reductions, completeness and the hardness of approximability (Q2488898) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Efficient approximation of convex recolorings (Q2643731) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
• Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
• On the complexity of approximating the independent set problem (Q5096160) (← links)
• Coresets for the Nearest-Neighbor Rule (Q5874517) (← links)