The following pages link to (Q4258216):
Displaying 50 items.
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- Note on maximal split-stable subgraphs (Q2381823) (← links)
- When the greedy algorithm fails (Q2386197) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- A linear approximation method for the Shapley value (Q2389675) (← links)
- Resource constrained scheduling on multiple machines (Q2390306) (← links)
- An algebraic proof of the real number PCP theorem (Q2396715) (← links)
- Genetic local search and hardness of approximation for the server load balancing problem (Q2399467) (← links)
- A cooperative game-theoretic approach to the social ridesharing problem (Q2407882) (← links)
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
- Intractability and approximation of optimization theories of cognition (Q2438604) (← 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)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Understanding planning with incomplete information and sensing (Q2457676) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- Discrete optimization algorithms and problems of decision making in a fuzzy environment (Q2460415) (← links)
- Constrained sequence alignment: A general model and the hardness results (Q2462385) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Inapproximability results for the lateral gene transfer problem (Q2479568) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- Controlling the losing probability in a monotone game (Q2489238) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion (Q2489961) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Algorithms of discrete optimization and their application to problems with fuzzy coefficients (Q2509222) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
- On the typical case complexity of graph optimization (Q2581548) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Cooperation through social influence (Q2630248) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- The complexity of shelflisting (Q2633440) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
