scientific article; zbMATH DE number 3639144

zbMath0411.68039MaRDI QIDQ4198056

Publication date: 1979

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

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 (only showing first 100 items - show all)

Outer 1-planar graphs ⋮ On-line algorithms for the dominating set problem ⋮ An approximation algorithm for clustering graphs with dominating diametral path ⋮ A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer ⋮ Scheduling chains to minimize mean flow time ⋮ A note on approximating graph genus ⋮ Orienting graphs to optimize reachability ⋮ Languages represented by Boolean formulas ⋮ When is a pair of matrices mortal? ⋮ Route selection with multiple metrics ⋮ Lower and upper bounds for long induced paths in 3-connected planar graphs ⋮ Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. ⋮ Improved performance of the greedy algorithm for partial cover ⋮ There is no asymptotic PTAS for two-dimensional vector packing ⋮ Improved solutions to the Steiner triple covering problem ⋮ The NPO-completeness of the longest Hamiltonian cycle problem ⋮ Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP ⋮ Scheduling cyclic tasks with binary periods ⋮ The Bandwidth Allocation Problem in the ATM network model is NP-complete ⋮ A 13/12 approximation algorithm for bin packing with extendable bins ⋮ Test sequence generation from the protocol data portion based on the selecting Chinese postman algorithm ⋮ Pattern matching for permutations ⋮ The homogeneous set sandwich problem ⋮ An approximate binary search algorithm for the multiple-choice knapsack problem ⋮ An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs ⋮ A polynomial time solvable instance of the feasible minimum cover problem ⋮ Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs ⋮ Constructibility classes for triangle location problems ⋮ Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms ⋮ \((1, j)\)-set problem in graphs ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ On the complexity of quality of service routing ⋮ Memory-efficient enumeration of constrained spanning trees ⋮ On-line scheduling with setup costs ⋮ Generating all maximal models of a Boolean expression ⋮ On edge-disjoint spanning trees with small depths ⋮ Feedback vertex set in hypercubes ⋮ Differential approximation results for the traveling salesman and related problems ⋮ On the approximability of two tree drawing conventions ⋮ Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles ⋮ An efficient time-free solution to SAT problem by P systems with proteins on membranes ⋮ Win-win kernelization for degree sequence completion problems ⋮ Fast processing of graph queries on a large database of small and medium-sized data graphs ⋮ The Red-Blue transportation problem ⋮ Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem ⋮ Coordination of production and interstage batch delivery with outsourced distribution ⋮ Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets ⋮ Spanning trees with variable degree bounds ⋮ Biogeography-based optimization for optimal job scheduling in cloud computing ⋮ On the metric dimension of circulant and Harary graphs ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ Weighted independent sets in classes of \(P_6\)-free graphs ⋮ On multi-objective optimization aided drawing of special graphs ⋮ Scheduling with few changes ⋮ Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs ⋮ Hop constrained Steiner trees with multiple root nodes ⋮ A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ Circular convex bipartite graphs: feedback vertex sets ⋮ On the algorithmic complexity of edge total domination ⋮ Guiding Craig interpolation with domain-specific abstractions ⋮ Matroid and knapsack center problems ⋮ New approximation algorithms for the unsplittable capacitated facility location problem ⋮ A new characterization of \(P_k\)-free graphs ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Bin covering with a general profit function: approximability results ⋮ Robust optimization for routing problems on trees ⋮ Gallai-Edmonds decomposition as a pruning technique ⋮ Proper orientation of cacti ⋮ Modelling practical placement of trainee teachers to schools ⋮ Inverse eccentric vertex problem on networks ⋮ Exact quadratic convex reformulations of mixed-integer quadratically constrained problems ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ On the tree search problem with non-uniform costs ⋮ Scattered packings of cycles ⋮ Minimum vertex cover in generalized random graphs with power law degree distribution ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ Late acceptance hill-climbing for high school timetabling ⋮ Scheduling evacuation operations ⋮ Acyclic colorings of graphs with bounded degree ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Fast Möbius inversion in semimodular lattices and ER-labelable posets ⋮ Sensor placement for fault location identification in water networks: a minimum test cover approach ⋮ Fast domino tileability ⋮ A comment on ``Computational complexity of stochastic programming problems ⋮ On the fractional strong metric dimension of graphs ⋮ Parameterized approximation algorithms for packing problems ⋮ The label cut problem with respect to path length and label frequency ⋮ The complexity of priced control in elections ⋮ On the hardness of bribery variants in voting with CP-nets ⋮ Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games ⋮ Complexity of metric dimension on planar graphs ⋮ The connected \(p\)-median problem on block graphs ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs

This page was built for publication: