scientific article; zbMATH DE number 3571502

Cited in

(only showing first 100 items - show all)

On computational complexity of length embeddability of graphs
Multitask n-vehicle exploration problem: complexity and algorithm
Revisiting the complexity of and/or graph solution
Some NP-complete problems in linear programming
Dynamic evolution of economically preferred facilities
Bandwidth contrained NP-complete problems
A comparison of polynomial time reducibilities
Online admission control and embedding of service chains
Relative complexity of checking and evaluating
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
On simulation and optimization of macroeconometric models
Positive relativizations of the \(P=?\) NP problem
Off-line temporary tasks assignment.
A fast and effective heuristic for the feedback arc set problem
The allocation problem in hardware design
A weighted graph polynomial from chromatic invariants of knots
TSP with bounded metrics
DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
Graph 2-isomorphism is NP-complete
Complexity-class-encoding sets
A graph model for scheduling processes in systems with parallel computations
Efficient Algorithms for (3,1) Graphs
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
Recognizing renamable generalized propositional Horn formulas is NP- complete
A fast approximation algorithm for solving the complete set packing problem
On polynomial-time Turing and many-one completeness in PSPACE
Approximating minimum feedback vertex sets in hypergraphs
Risk models for the prize collecting Steiner tree problems with interval data
On-line generalized Steiner problem
Edge-contraction problems
Minimizing the expected weighted number of tardy jobs in stochastic flow shops
One more polynomial complete consecutive retrieval problem
A shifting algorithm for constrained min-max partition on trees
On the complexity of regular resolution and the Davis-Putnam procedure
Subgraph isomorphism, matching relational structures and maximal cliques
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
An NP-complete matching problem
Spectral bounds for the maximum cut problem
Exact solution of the 2-dimensional grid arrangement problem
Large induced forests in planar graphs with girth 4
Colorings at minimum cost
A new clustering algorithm for coordinate-free data
Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
Die Zeitkomplexität des Normalisierungsproblems bei kontextsensitiven Grammatiken
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
The complexity of regular subgraph recognition
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Worst-case performance of Rayward-Smith's Steiner tree heuristic
Steiner's problem in double trees
On the terminal Steiner tree problem.
A new approach to the learning effect: Beyond the learning curve restrictions
Partition into cliques for cubic graphs: Planar case, complexity and approximation
On the facial structure of set packing polyhedra
Toward a unified approach for the classification of NP-complete optimization problems
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Scheduling two-stage hybrid flow shop with availability constraints
A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
Efficient approximation algorithms for the subset-sums equality problem.
Characterizations and computational complexity of systolic trellis automata
Non-standard approaches to integer programming
On the enumeration of certain weighted graphs
The complexity of computing the permanent
Processor optimization for flow graphs
Scheduling with batching: Minimizing the weighted number of tardy jobs
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Graph theoretic relaxations of set covering and set partitioning problems
A linear algorithm for the Hamiltonian completion number of a tree
Gap inequalities for non-convex mixed-integer quadratic programs
Complexity in mechanized hypothesis formation
On the Pólya permanent problem over finite fields
Improved approximation bounds for the minimum rainbow subgraph problem
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Monge matrices make maximization manageable
Extended and discretized formulations for the maximum clique problem
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Feasible arithmetic computations: Valiant's hypothesis
Optimal cuts in graphs and statistical mechanics
Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
Finding odd cycle transversals.
On the existence of tree backbones that realize the chromatic number on a backbone coloring
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
On the complexity of finding balanced oneway cuts
Counting the number of vertex covers in a trapezoid graph
Approximation algorithms for combinatorial problems
An introduction to the analysis of approximation algorithms
Graph properties checkable in linear time in the number of vertices
Even initial feedback vertex set problem is NP-complete
Electronic circuit diagnostic expert systems - a survey
A cross-border transportation system under supply and demand constraints
A constraint programming approach to cutset problems
Efficient approximation of Min Set Cover by moderately exponential algorithms
Minimizing the expected number of tardy jobs when processing times are normally distributed
Heuristics for scheduling unrelated parallel machines
Change ringing and Hamiltonian cycles: the search for Erin and Stedman triples
The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two

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 Q4142699)