Pages that link to "Item:Q1186548"

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

Displaying 13 items.

• Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
• There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
• Rounding algorithms for covering problems (Q1380937) (← links)
• Some APX-completeness results for cubic graphs (Q1566710) (← links)
• Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization (Q1932035) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
• TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE (Q2929619) (← links)
• atalog: A logic language for expressing search and optimization problems (Q3550912) (← links)
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
• On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)