Pages that link to "Item:Q1186548"
From MaRDI portal
The following pages link to Optimization, approximation, and complexity classes (Q1186548):
Displaying 50 items.
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Inapproximability results for the lateral gene transfer problem (Q2479568) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- A tutorial on the cross-entropy method (Q2485925) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- A class of node based bottleneck improvement problems (Q2503225) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms (Q2509535) (← links)
- A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model (Q2513674) (← links)
- Optimal deterministic auctions with correlated priors (Q2516251) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Complexity results for rainbow matchings (Q2637345) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Logspace optimization problems and their approximability properties (Q2642909) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- Probabilistic nonunitary gate in imaginary time evolution (Q2690483) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← 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)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Learning hurdles for sleeping experts (Q2828218) (← links)
- On the maximum uniquely restricted matching for bipartite graphs (Q2840733) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap (Q2868930) (← links)
- Approximation of the clustered set covering problem (Q2883599) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
