Newman, Alantha ;
Röglin, Heiko ;
Seif, Johanna
The Alternating Stock Size Problem and the Gasoline Puzzle
Abstract
Given a set S of integers whose sum is zero, consider the problem of finding a permutation of these integers such that: (i) all prefixes of the ordering are nonnegative, and (ii) the maximum value of a prefix sum is minimized. Kellerer et al. referred to this problem as the stock size problem and showed that it can be approximated to within 3/2. They also showed that an approximation ratio of 2 can be achieved via several simple algorithms.
We consider a related problem, which we call the alternating stock size problem, where the number of positive and negative integers in the input set S are equal. The problem is the same as above, but we are additionally required to alternate the positive and negative numbers in the output ordering. This problem also has several simple 2approximations. We show that it can be approximated to within 1.79.
Then we show that this problem is closely related to an optimization version of the gasoline puzzle due to Lovász, in which we want to minimize the size of the gas tank necessary to go around the track. We present a 2approximation for this problem, using a natural linear programming relaxation whose feasible solutions are doubly stochastic matrices. Our novel rounding algorithm is based on a transformation that yields another doubly stochastic matrix with special properties, from which we can extract a suitable permutation.
BibTeX  Entry
@InProceedings{newman_et_al:LIPIcs:2016:6413,
author = {Alantha Newman and Heiko R{\"o}glin and Johanna Seif},
title = {{The Alternating Stock Size Problem and the Gasoline Puzzle}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {71:171:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770156},
ISSN = {18688969},
year = {2016},
volume = {57},
editor = {Piotr Sankowski and Christos Zaroliagis},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6413},
URN = {urn:nbn:de:0030drops64134},
doi = {10.4230/LIPIcs.ESA.2016.71},
annote = {Keywords: approximation algorithms, stock size problem, scheduling with nonrenewable resources}
}
2016
Keywords: 

approximation algorithms, stock size problem, scheduling with nonrenewable resources 
Seminar: 

24th Annual European Symposium on Algorithms (ESA 2016)

Issue date: 

2016 
Date of publication: 

2016 