Pages that link to "Item:Q464901"

The following pages link to On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901):

Displaying 8 items.

• Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
• Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
• A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
• The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554) (← links)
• Reoptimization of parameterized problems (Q2170282) (← links)
• Reoptimization of set covering problems (Q2247803) (← links)
• Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph (Q2846477) (← links)
• On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)