Differential Ratio Approximation

Ausiello, Giorgio; Paschos, Vangélis Th.

doi:10.1201/9781420010749.ch16

Cited by 2 publications

(3 citation statements)

References 42 publications

(95 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Moreover, we will try to find another reliable alternative to devise different FPTAS as it is done in other references [9], [3], [2]. Finally, the study of differential approximation seems of a great interest since the general pagination problem is difficult to approximate [1].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

2023

View full text Add to dashboard Cite

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 integer capacity C. The objective is to find the minimal number of pages (a type of container) on which we can schedule all the tiles while following two fundamental rules. We cannot assign more than C symbols on each page and a tile cannot be broken into several pieces, all of its symbols must be assigned to at least one of the pages. The dierence from the Bin Packing Problem is that tiles can merge. If two tiles share a subset of symbols and if they are assigned to the same page, this subset will be assign only once to the page (and not several times). In this paper, as this problem is NP-complete, we are going to look at a particular case of the dual problem, where we have exactly two pages for which the capacity must be minimized. We are going to present a fully polynomial time approximation scheme (FPTAS) to solve it. This approximation scheme is based on the simplification of a dynamic programming algorithm and it has a strongly polynomial time complexity. The conducted numerical experiments show its practical eectiveness.

show abstract

Section: Discussionmentioning

confidence: 99%

“…. 1 Université de Lorraine, LCOMS, Metz, France, Email: aristide.grange@univ-lorraine.fr 2 Corresponding author. Université de Lorraine, LCOMS, Metz, France, Email: imed.kacem@univlorraine.fr 3 Université de Lorraine, LCOMS, Metz, France, Email: sebastien.martin@univ-lorraine.fr 4 Université de Lorraine, LCOMS, Metz, France, Email: sarah.minich@univ-lorraine.fr…”

unclassified

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

2023

View full text Add to dashboard Cite

show abstract

“…Such an approximation measure takes the name of differential approximation. Several dozens of papers present differential approximation results for traditional problems of combinatorial optimization; see the review Ausiello and Paschos (2007).…”

Section: Differential Approximation Schemesmentioning

confidence: 99%

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

Kellerer

Strusevich

2015

Ann Oper Res

View full text Add to dashboard Cite

show abstract

Differential Ratio Approximation

Abstract: In this paper, we survey the fundamentals of the differential approximation theory, as well as some operational and structural results.

Cited by 2 publications

References 42 publications

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

Contact Info

Product

Resources

About