Pages that link to "Item:Q4999425"
From MaRDI portal
The following pages link to Reducibility among Combinatorial Problems (Q4999425):
Displayed 50 items.
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- A meta-heuristic approach for improving the accuracy in some classification algorithms (Q709124) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- The clique-partitioning problem (Q807637) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- Complexity of the minimum-length corridor problem (Q876503) (← links)
- Subjective-cost policy routing (Q883998) (← links)
- Complexity-theoretic algebra. II: Boolean algebras (Q915723) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- Minimizing channel density in standard cell layout (Q1102924) (← links)
- Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms (Q1116908) (← links)
- On computational complexity of invalidating structured uncertainty models (Q1128693) (← links)
- Optimum and suboptimum methods for permuting a matrix into bordered triangular form (Q1135085) (← links)
- The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- Optimization problems and the polynomial hierarchy (Q1152218) (← links)
- The 0-1 integer programming problem in a finite ring with identity (Q1155522) (← links)
- Some simplified undecidable and NP-hard problems for simple programs (Q1157168) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- Distributed subcube identification algorithms for reliable hypercubes (Q1178248) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- A note on bounding \(k\)-terminal reliability (Q1186804) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- Complexity of the closest vector problem in a lattice generated by a (0,1)-matrix (Q1198041) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- An observation on time-storage trade off (Q1217591) (← links)
- Acyclic orientations of a graph and the chromatic and independence numbers (Q1227749) (← links)
- Constructing optimal binary decision trees is NP-complete (Q1228355) (← links)
- Log space machines with multiple oracle tapes (Q1242686) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674) (← links)
- Mysteries of mathematics and computation (Q1323030) (← links)
- Computability and complexity of ray tracing (Q1327451) (← links)
- Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
- A note on implementing parallel assignment instructions (Q1393119) (← links)
- Parallel machine scheduling with a common server (Q1566574) (← links)
- Complexity of fragmentable object bin packing and an application (Q1608419) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Constraint satisfaction problems: Algorithms and applications (Q1809839) (← links)