scientific article

zbMath0522.68040MaRDI QIDQ3673102

Michael R. Garey, David S. Johnson

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partitionspuzzlesNP-completenesssequencingnetwork designapproximation algorithmsstorageretrievalprogram optimizationalgebranumber theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Game theory (91A99) Combinatorial aspects of partitions of integers (05A17) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of design theory to circuits and networks (94C30) Artificial intelligence (68T99) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Applications of graph theory to circuits and networks (94C15) Information storage and retrieval of data (68P20) Mathematical programming (90C99) Theory of software (68N99)

Related Items

Analysis of sketch images with metrics, On Problem of Finding all Maximal Induced Bicliques of Hypergraph, A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension, Genetic local search and hardness of approximation for the server load balancing problem, The network-untangling problem: from interactions to activity timelines, Unnamed Item, On the complexity of incremental computation, On the monophonic rank of a graph, An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems, Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem, Elements of Fuzzy Logic in Solving Clustering Problems, Connected feedback vertex set on AT-free graphs, On the robust shortest path problem., Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, Secure connected domination and secure total domination in unit disk graphs and rectangle graphs, Unnamed Item, Modelling railway freight traffic using the methods of graph theory and combinatorial optimization, Graph theory (algorithmic, algebraic, and metric problems), Parallelization of automata, No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths, Unnamed Item, Tropical lower bound for extended formulations. II. Deficiency graphs of matrices, Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs, Accounting for the time characteristics of a class of scheduling problems for moving processor