Year of publication
Type of material
Licence
Language
1–20 of 4,193 hits
Sort by:
Sort by:
-
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Online Contents | 2019|Keywords: Polynomial time solvable subclass, Polynomial time approximation scheme -
Penalty cost constrained identical parallel machine scheduling problem
Elsevier | 2015|Keywords: Polynomial time approximation scheme, Fully polynomial time approximation scheme -
An improved version of Chubanov's method for solving a homogeneous feasibility problem
Free accessTaylor & Francis Verlag | 2018|Keywords: polynomial-time -
Fields of Algebraic Numbers Computable in Polynomial Time. II
Online Contents | 2022|Keywords: equivalence of polynomial-time computable structures, polynomial-time computable structures -
A complexity and approximation framework for the maximization scaffolding problem
Elsevier | 2015|Keywords: Polynomial-time approximation algorithm -
Polynomial time algorithms and extended formulations for unit commitment problems
Taylor & Francis Verlag | 2018|Keywords: polynomial-time algorithm -
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Online Contents | 2019|Keywords: Polynomial time solvable subclass, Polynomial time approximation scheme -
Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
Springer Verlag | 2024|Keywords: Polynomial time approximation scheme, Efficient polynomial time approximation scheme, Fully polynomial time approximation scheme -
Single-machine scheduling with a variable maintenance activity
Elsevier | 2014|Keywords: Polynomial-time algorithm -
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Elsevier | 2008|Keywords: Polynomial-time algorithm -
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
Wiley | 2016|Keywords: fully polynomial‐time approximation scheme -
Büchi Good-for-Games Automata Are Efficiently Recognizable
Free accessDataCite | 2018|Keywords: polynomial time -
Polynomially solvable personnel rostering problems
Elsevier | 2015|Keywords: Polynomial time algorithms -
Encoding Invariance in Average Case Complexity
Online Contents | 2013|Keywords: Polynomial time samplable distribution, Polynomial time computable distribution -
Fine-Grained Algorithms and Complexity (Invited Talk)
Free accessDataCite | 2016|Keywords: polynomial time problems -
A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
EDP Sciences | 2019|Keywords: polynomial-time approximation scheme -
Vertex coloring of graphs with few obstructions
Elsevier | 2015|Keywords: Polynomial-time algorithm -
Some observations on the probabilistic algorithms and NP-hard problems
National licenceElsevier | 1981|Keywords: polynomial time computation, polynomial time hierarchy -
NP‐Completeness
Wiley | 2014|Keywords: polynomial‐time many‐one reducibility, Polynomial‐Time Turing Reducibility
Send my search to (beta)
Send your search query (search terms without filters) to other databases, portals and catalogues to find more interesting hits.
Dimensions:
full data search
or
title and abstract search
Dimensions is a database for abstracts and citations that links information on research funding with the resulting publications, studies and patents.
TIB AV portal
In the TIB AV-Portal, audiovisual media from science and teaching can be foundand own scientific videos can be published.
Specialised Information Service for Mobility and Transport Research (FID move)
Open Research Knowledge Graph (ORKG)
The FID move can be used to search for subject-specific literature, research data and other information from mobility and transport research.
The Open Research Knowledge Graph provides structured descriptions of research content and makes it comparable.
Common Union Catalogue (GVK)
Freely accessible part of the collaborative K10plus catalogue with materials relevant for interlibrary loan and direct delivery services.