Výsledky vyhľadávania - "fully polynomial-time approximation scheme"

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme Autor Trummer, Immanuel, Faltings, Boi, Binder, Walter

“…The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are…”
Získať plný text

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date Autor Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek

“…•Fully polynomial time approximation scheme for early work maximization is proposed…”
Získať plný text

A fully polynomial time approximation scheme for the probability maximizing shortest path problem Autor Lee, Jisun, Joung, Seulgi, Lee, Kyungsik

“…•A novel fully polynomial time approximation scheme (is proposed). In this paper, we consider a probability maximizing shortest path problem…”
Získať plný text

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches Autor Jeong, In-Jae

“…For a transportation line without branches, passenger service scheduling is mainly concerned with the determination of stop schedules for planned service…”
Získať plný text

A fully polynomial time approximation scheme for the Replenishment Storage problem Autor Hochbaum, Dorit S., Rao, Xu

“…The Replenishment Storage problem (RSP) is to minimize the storage capacity requirement for a deterministic demand, multi-item inventory system with specified…”
Získať plný text

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles Autor Grange, Aristide, Kacem, Imed, Martin, Sébastien, Minich, Sarah

“…The pagination problem is described as follows. We have a set of symbols, a collection of subsets over these symbols (we call these subsets the tiles) and an…”
Získať plný text

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs Autor Zhao, Chuanli, Hsu, Chou-Jung

“… The objective is to minimize the weighted number of tardy jobs. A pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approximation scheme…”
Získať plný text

A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State Autor Antoniadis, Antonios, Huang, Chien-Chung, Ott, Sebastian

“…We study classical deadline-based preemptive scheduling of jobs in a computing environment equipped with both dynamic speed scaling and sleep state…”
Získať plný text

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy Autor Halman, Nir

“…Given n elements with nonnegative integer weights w=(w1,…,wn), an integer capacity C and positive integer ranges u=(u1,…,un), we consider the counting version…”
Získať plný text

A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops Autor Dong, Jianming, Jin, Ruyan, Hu, Jueliang, Lin, Guohui

“…A two-stage openshop consists of a machine in the first stage and a machine in the second stage; a job processed on the two-stage openshop means it is…”
Získať plný text

A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint Autor Bai, Mengzhuo, Zhao, Yufang

“… Firstly, a fully polynomial-time approximation scheme (FPTAS) was given for the problem, and afterwards that FPTAS was extended for the single-machine scheduling…”
Získať plný text

A new fully polynomial time approximation scheme for the interval subset sum problem Autor Diao, Rui, Liu, Ya-Feng, Dai, Yu-Hong

“…), albeit the problem is generally NP-hard. Then, we propose a new fully polynomial time approximation scheme for solving the general ISSP problem…”
Získať plný text

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand Autor Halman, Nir, Klabjan, Diego, Mostagir, Mohamed, Orlin, Jim, Simchi-Levi, David

“… In this paper, we prove that this problem is intractable and design for it a fully polynomial-time approximation scheme…”
Získať plný text

A fully polynomial-time approximation scheme for approximating a sum of random variables Autor Li, Jian, Shi, Tianlin

“… We give the first deterministic fully polynomial-time approximation scheme (FPTAS) to estimate the probability up to a relative error of 1±ϵ…”
Získať plný text

Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem Autor Kel’manov, A. V., Khandeev, V. I.

“…The strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters of given sizes (cardinalities) minimizing the sum…”
Získať plný text

A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs Autor Kang, Liying, Ng, C.T.

“… Each job's processing time is a linear nondecreasing function of its start time. We present a fully polynomial-time approximation scheme for the problem, thus…”
Získať plný text

A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date” Autor Kianfar, K., Moslehi, G.

“…In this note, through a counter-example we show that the results in a recent paper (Kacem, 2010)  [1] are incorrect. Since the proposed dynamic programming in…”
Získať plný text

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? Autor Woeginger, Gerhard J

“… involved cost and transition functions satisfy certain arithmetical and structural conditions, then the optimization problem automatically possesses a fully polynomial time approximation scheme (FPTAS…”
Získať plný text

A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem Autor Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I.

“…We consider a strongly NP-hard problem of partitioning a finite sequence of points in Euclidean space into the two clustersminimizing the sum over both…”
Získať plný text

Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date Autor Kacem, Imed

“…] by Kellerer and Strusevich. They proposed a fully polynomial time approximation scheme (FPTAS) of O ( ( n 6 log W ) / ε 3 ) time complexity ( W is the sum of weights, n is the number of jobs…”
Získať plný text