Pages that link to "Item:Q672315"

The following pages link to Approximate solution of NP optimization problems (Q672315):

Displaying 26 items.

• The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
• Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
• On the approximability of two tree drawing conventions (Q294876) (← links)
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420) (← links)
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
• Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
• An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\)) (Q924126) (← links)
• Inapproximability results for equations over infinite groups (Q974745) (← links)
• Alphabet indexing for approximating features of symbols (Q1274598) (← links)
• On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
• A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
• The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• On computing the latest starting times and floats of activities in a network with imprecise durations (Q1770714) (← links)
• Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
• Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
• Reductions, completeness and the hardness of approximability (Q2488898) (← links)
• Elementary team strategies in a monotone game (Q2581719) (← links)
• Order preserving reductions and polynomial improving paths (Q2583701) (← links)
• Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
• On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)