Pages that link to "Item:Q5441360"
From MaRDI portal
The following pages link to Some optimal inapproximability results (Q5441360):
Displaying 50 items.
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- Fuzzy covering problem of fuzzy graphs and its application to investigate the Indian economy in new normal (Q2143813) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Covering problem on fuzzy graphs and its application in disaster management system (Q2157042) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Accelerating deep learning with memcomputing (Q2182923) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Approximation algorithms for geometric conflict free covering problems (Q2206716) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
- Optimizing positional scoring rules for rank aggregation (Q2321258) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Eigenvector-based identification of bipartite subgraphs (Q2328104) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685) (← links)
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- Note on maximal split-stable subgraphs (Q2381823) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- Improved approximation algorithms for the spanning star forest problem (Q2392922) (← links)
- An algebraic proof of the real number PCP theorem (Q2396715) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Inapproximability ratios for crossing number (Q2413159) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- Vertex cover in conflict graphs (Q2424881) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- Quantitative relation between noise sensitivity and influences (Q2448963) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
