Pages that link to "Item:Q4158479"

The following pages link to `` Strong '' NP-Completeness Results (Q4158479):

Displaying 50 items.

• Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
• The complexity of equality constraint languages (Q929295) (← links)
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
• Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
• Minimal split completions (Q967310) (← links)
• Finding the longest isometric cycle in a graph (Q967311) (← links)
• Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• On the complexity of crossings in permutations (Q1011761) (← links)
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
• An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Q1026103) (← links)
• How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
• PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
• The largest tree in a random graph (Q1050116) (← links)
• The complexity of the 0/1 multi-knapsack problem (Q1076516) (← links)
• An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
• A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
• Unimodular functions (Q1079493) (← links)
• The two-machine sequence dependent flowshop scheduling problem (Q1081528) (← links)
• Computation on binary tree-networks (Q1082077) (← links)
• The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
• Edge-connectivity augmentation problems (Q1091147) (← links)
• NP-completeness of the linear complementarity problem (Q1095806) (← links)
• A note on complete problems for complexity classes (Q1097029) (← links)
• The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
• Algorithms to solve the orienteering problem: A comparison (Q1119489) (← links)
• Deleting completed transactions (Q1123021) (← links)
• The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
• Complexity results for scheduling chains on a single machine (Q1142687) (← links)
• Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
• Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
• On minimal augmentation of a graph to obtain an interval graph (Q1154281) (← links)
• General approximation algorithms for some arithmetical combinatorial problems (Q1158970) (← links)
• Chordal graphs and upper irredundance, upper domination and independence (Q1174126) (← links)
• The hierarchical network design problem with transshipment facilities (Q1178636) (← links)
• COSINE: A new graph coloring algorithm (Q1180823) (← links)
• Finding large holes (Q1182105) (← links)
• Constructive complexity (Q1182305) (← links)
• Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
• Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
• An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
• On reversal-bounded picture languages (Q1200803) (← links)
• The max clique problem in classes of string-graphs (Q1201270) (← links)
• A minimum 3-connectivity augmentation of a graph (Q1208926) (← links)
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
• An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
• A heuristic algorithm for the mini-max spanning forest problem (Q1278250) (← links)
• A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)