scientific article; zbMATH DE number 3827200
algebraapproximation algorithmsnetwork designNP-completenessnumber theorypartitionsprogram optimizationpuzzlesretrievalsequencingstorage
Complexity of computation (including implicit computational complexity) (03D15) Combinatorial aspects of partitions of integers (05A17) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99) Deterministic scheduling theory in operations research (90B35) Mathematical programming (90C99) Game theory (91A99) Applications of graph theory to circuits and networks (94C15) Applications of design theory to circuits and networks (94C30)
- Limits of computation. An introduction to the undecidable and the intractable
- Computation and intractability: echoes of Kurt Gödel
- scientific article; zbMATH DE number 3880670
- scientific article; zbMATH DE number 1560883
- The Incomputable
- Computability, complexity, logic. Transl. from the German
- scientific article; zbMATH DE number 890268
- From the \textit{Entscheidungsproblem} to the personal computer -- and beyond
- Computability. Turing, Gödel, Church, and beyond
- scientific article; zbMATH DE number 43004
- Parallelization of automata
- On the robust shortest path problem.
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
- 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
- Accounting for the time characteristics of a class of scheduling problems for moving processor
- The network-untangling problem: from interactions to activity timelines
- 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
- Analysis of sketch images with metrics
- Tropical lower bound for extended formulations. II: Deficiency graphs of matrices
- Pareto optimality in the kidney exchange Problem
- On problem of finding all maximal induced bicliques of hypergraph
- On the complexity of incremental computation
- Modelling railway freight traffic using the methods of graph theory and combinatorial optimization
- scientific article; zbMATH DE number 7310290 (Why is no real title available?)
- Graph theory (algorithmic, algebraic, and metric problems)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- 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
- Multi-agent single machine scheduling problem with transportation constraints
- Elements of Fuzzy Logic in Solving Clustering Problems
- Connected feedback vertex set on AT-free graphs
- Parameter tuning of continuous Hopfield network applied to combinatorial optimization
- A survey on variant domination problems in geometric intersection graphs
- Fractal networks: topology, dimension, and complexity
- The MaxIS-Shapley value in perfect graphs
- A dynamic programming algorithm for the maximum s-club problem on trees
- Sum-of-max chain partition of a tree
- On the constrained Steiner strong connectivity augmentation problem
- Recursive sparse LU decomposition based on nested dissection and low rank approximations
- New models for close enough facility location problems
- Machine learning and data analysis method for predicting an efficient algorithm for heterogeneous multicore scheduling
- Discrete gorilla troops optimization with two neighborhood searches for symmetric traveling salesman problem
- On computational aspects of cores of ordered graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673102)
