Approximation algorithms for combinatorial fractional programming problems
Mathematical Programming: Series A and B
Introduction to algorithms
An analysis of stochastic shortest path problems
Mathematics of Operations Research
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Combinatorial optimization with rational objective functions
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Approximating a class of combinatorial problems with rational objective function
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for fractional knapsack problems
Operations Research Letters
Hi-index | 0.00 |
Consider the generic situation that we have to select k alternatives from a given ground set, where each element in the ground set has a random arrival time and cost. Once we have done our selection, we will greedily select the first arriving alternative, and the total cost is the time we had to wait for this alternative plus its random cost. Our motivation to study this problem comes from public transportation, where each element in the ground set might correspond to a bus or train, and the usual user behavior is to greedily select the first option from a given set of alternatives at each stop. We consider the arguably most natural arrival time distributions for such a scenario: exponential distributions, uniform distributions, and distributions with mon. decreasing linear density functions. For exponential distributions, we show how to compute an optimal policy for a complete network, called a shortest path with alternatives, in $ {\mathcal O}( n ( \log n + \delta^3 ) ) $ time, where n is the number of nodes and δ is the maximal outdegree of any node, making this approach practicable for large networks if δ is relatively small. Moreover, for the latter two distributions, we give PTASs for the case that the distribution supports differ by at most a constant factor and only a constant number of hops are allowed in the network, both reasonable assumptions in practice. These results are obtained by combining methods from low-rank quasi-concave optimization with fractional programming. We finally complement them by showing that general distributions are NP-hard.