Pages that link to "Item:Q4210142"
From MaRDI portal
The following pages link to On Syntactic versus Computational Views of Approximability (Q4210142):
Displaying 50 items.
- A note on anti-coordination and social interactions (Q386417) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming (Q507445) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Integer programming as a framework for optimization and approximability (Q1276163) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
- A syntactic view of computational adequacy (Q1652968) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem (Q1884968) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- Computing unrestricted synopses under maximum error bound (Q1939676) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) (Q1961444) (← links)
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- On the approximation ratio of the 3-opt algorithm for the \((1,2)\)-TSP (Q2060589) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Nonoblivious 2-opt heuristics for the traveling salesman problem (Q2811309) (← links)
