Pages that link to "Item:Q1186548"

The following pages link to Optimization, approximation, and complexity classes (Q1186548):

Displaying 50 items.

• On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
• On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
• New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
• Inferring a tree from walks (Q1351963) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
• The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
• MNP: A class of NP optimization problems (Q1368182) (← links)
• Rounding algorithms for covering problems (Q1380937) (← links)
• Metafinite model theory (Q1383163) (← links)
• On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
• Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
• Studying the complexity of global verification for NP-hard discrete optimization problems (Q1402543) (← links)
• The task allocation problem with constant communication. (Q1408823) (← links)
• Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
• On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
• Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
• Distinguishing string selection problems. (Q1427861) (← links)
• Differential approximation results for the Steiner tree problem (Q1431874) (← links)
• Some APX-completeness results for cubic graphs (Q1566710) (← links)
• Counting problems over the reals (Q1575534) (← links)
• Interactive and probabilistic proof-checking (Q1577488) (← links)
• Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
• Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
• Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
• A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
• Hardness results for neural network approximation problems (Q1603592) (← links)
• Which problems have strongly exponential complexity? (Q1604206) (← links)
• A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
• Computing similarity between RNA structures (Q1605306) (← links)
• On bounded occurrence constraint satisfaction (Q1607037) (← links)
• The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
• Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• On the complexity of computing MP distance between binary phylogenetic trees (Q1682616) (← links)
• Sparsification and subexponential approximation (Q1702300) (← links)
• The many facets of upper domination (Q1704853) (← links)
• The complexity of secure domination problem in graphs (Q1708386) (← links)
• Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
• Restricted assignment scheduling with resource constraints (Q1713408) (← links)
• Affine reductions for LPs and SDPs (Q1717229) (← links)
• Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• Finding a potential community in networks (Q1737592) (← links)
• Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← links)
• Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
• Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
• Competitive algorithms for multistage online scheduling (Q1753459) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)