Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint (Q2149857) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)
- The optimal statistical median of a convex set of arrays (Q2271158) (← links)
- The ferry cover problem (Q2272191) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Assortment planning for multiple chain stores (Q2319385) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- On constructing an optimal consensus clustering from multiple clusterings (Q2380012) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- On defensive alliances and strong global offensive alliances (Q2434727) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
