Pages that link to "Item:Q4146529"
From MaRDI portal
The following pages link to Two-Processor Scheduling with Start-Times and Deadlines (Q4146529):
Displaying 50 items.
- Shelf algorithms for on-line strip packing (Q287167) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- Data sufficiency for queries on cache (Q293243) (← links)
- On the complexity of Boolean unification (Q293360) (← links)
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints (Q417989) (← links)
- Universal number partition problem with divisibility (Q418873) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics (Q553339) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Reconstructing sets of orthogonal line segments in the plane (Q688265) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- On Ringeisen's isolation game (Q751522) (← links)
- A study of the application of Kohonen-type neural networks to the travelling salesman problem (Q757268) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Arbres avec un nombre maximum de sommets pendants (Q793746) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources (Q974099) (← links)
- Fall colouring of bipartite graphs and Cartesian products of graphs (Q1003677) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- A note on a theorem by Ladner (Q1051633) (← links)
- Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets (Q1071516) (← links)
- Equivalent approximation algorithms for node cover (Q1077934) (← links)
- Encryption using Hungarian rings (Q1090306) (← links)
- Performance evaluation of concurrent systems using conflict-free and persistent Petri nets (Q1108799) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628) (← links)
- How well can a graph be n-colored? (Q1148324) (← links)
- Balancing signed graphs (Q1156154) (← links)
- NP-completeness of some generalizations of the maximum matching problem (Q1168728) (← links)
- Computing independent sets in graphs with large girth (Q1183338) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
