Pages that link to "Item:Q4158479"
From MaRDI portal
The following pages link to `` Strong '' NP-Completeness Results (Q4158479):
Displaying 50 items.
- An approximation algorithm for maximum packing of 3-edge paths (Q287133) (← links)
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors (Q287150) (← links)
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- Approximation of the parallel machine scheduling problem with additional unit resources (Q323055) (← links)
- Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration (Q398857) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- Cop-robber guarding game with cycle robber-region (Q620952) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Knapsack problems for NL (Q673615) (← links)
- A logic for programming with complex objects (Q686642) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- On legal path problems in digraphs (Q790621) (← links)
- On the computational complexity of path cover problems (Q799105) (← links)
- Fuzzy shortest paths (Q805505) (← links)
- Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
- Cellular automata and discrete neural networks (Q807039) (← links)
- A bound for the Dilworth number (Q809096) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Single machine scheduling problems with resource dependent release times (Q868136) (← links)
- Lot-sizing scheduling with batch setup times (Q880550) (← links)
- A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
- Scheduling batches on parallel machines with major and minor set-ups (Q918855) (← links)
