Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets

Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: "which set in I is the most difficult to connect up?" This is an example of a max-min problem: find the set A in I such that the value of some minimization (covering) problem is as large as possible. In this paper, we show that for certain covering problems which admit good deterministic online algorithms, we can give good algorithms for max-min optimization when the set system I is given by a p-system or q-knapsacks or both. This result is similar to results for constrained maximization of submodular functions. Although many natural covering problems are not even approximately submodular, we show that one can use properties of the online algorithm as a surrogate for submodularity. Moreover, we give stronger connections between max-min optimization and two-stage robust optimization, and hence give improved algorithms for robust versions of various covering problems, for cases where the uncertainty sets are given by p-systems and q-knapsacks.Comment: 17 pages. Preliminary version combining this paper and http://arxiv.org/abs/0912.1045 appeared in ICALP 201

Capacity of Fading Gaussian Channel with an Energy Harvesting Sensor Node

Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over a fading AWGN channel with perfect/no channel state information provided at the transmitter. We obtain an achievable rate when there are inefficiencies in energy storage and the capacity when energy is spent in activities other than transmission.Comment: 6 Pages, To be presented at IEEE GLOBECOM 201

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

We consider the problem of constructing optimal decision trees: given a collection of tests which can disambiguate between a set of $m$ possible diseases, each test having a cost, and the a-priori likelihood of the patient having any particular disease, what is a good adaptive strategy to perform these tests to minimize the expected cost to identify the disease? We settle the approximability of this problem by giving a tight $O(\log m)$-approximation algorithm. We also consider a more substantial generalization, the Adaptive TSP problem. Given an underlying metric space, a random subset $S$ of cities is drawn from a known distribution, but $S$ is initially unknown to us--we get information about whether any city is in $S$ only when we visit the city in question. What is a good adaptive way of visiting all the cities in the random subset $S$ while minimizing the expected distance traveled? For this problem, we give the first poly-logarithmic approximation, and show that this algorithm is best possible unless we can improve the approximation guarantees for the well-known group Steiner tree problem.Comment: 28 pages; to appear in Mathematics of Operations Researc

Minimum Makespan Multi-vehicle Dial-a-Ride

Dial a ride problems consist of a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs, where each object requires to be moved from its source to destination vertex. We consider the multi-vehicle Dial a ride problem, with each vehicle having capacity k and its own depot-vertex, where the objective is to minimize the maximum completion time (makespan) of the vehicles. We study the "preemptive" version of the problem, where an object may be left at intermediate vertices and transported by more than one vehicle, while being moved from source to destination. Our main results are an O(log^3 n)-approximation algorithm for preemptive multi-vehicle Dial a ride, and an improved O(log t)-approximation for its special case when there is no capacity constraint. We also show that the approximation ratios improve by a log-factor when the underlying metric is induced by a fixed-minor-free graph.Comment: 22 pages, 1 figure. Preliminary version appeared in ESA 200

An experimental documentation of a separated trailing-edge flow at a transonic Mach number

A detailed experiment on the separated flow field at a sharp trailing edge is described and documented. The separated flow is a result of sustained adverse pressure gradients. The experiment was conducted using an elongated airfoil-like model at a transonic Mach number and at a high Reynolds number of practical interest. Measurements made include surface pressures and detailed mean and turbulence flow quantities in the region just upstream of separation to downstream into the near-wake, following wake closure. The data obtained are presented mostly in tabular form. These data are of sufficient quality and detail to be useful as a test case for evaluating turbulence models and calculation methods

Dial a Ride from k-forest

The k-forest problem is a common generalization of both the k-MST and the dense-$k$-subgraph problems. Formally, given a metric space on $n$ vertices $V$, with $m$ demand pairs $\subseteq V \times V$ and a ``target'' $k\le m$, the goal is to find a minimum cost subgraph that connects at least $k$ demand pairs. In this paper, we give an $O(\min\{\sqrt{n},\sqrt{k}\})$-approximation algorithm for $k$-forest, improving on the previous best ratio of $O(n^{2/3}\log n)$ by Segev & Segev. We then apply our algorithm for k-forest to obtain approximation algorithms for several Dial-a-Ride problems. The basic Dial-a-Ride problem is the following: given an $n$ point metric space with $m$ objects each with its own source and destination, and a vehicle capable of carrying at most $k$ objects at any time, find the minimum length tour that uses this vehicle to move each object from its source to destination. We prove that an $\alpha$-approximation algorithm for the $k$-forest problem implies an $O(\alpha\cdot\log^2n)$-approximation algorithm for Dial-a-Ride. Using our results for $k$-forest, we get an $O(\min\{\sqrt{n},\sqrt{k}\}\cdot\log^2 n)$- approximation algorithm for Dial-a-Ride. The only previous result known for Dial-a-Ride was an $O(\sqrt{k}\log n)$-approximation by Charikar & Raghavachari; our results give a different proof of a similar approximation guarantee--in fact, when the vehicle capacity $k$ is large, we give a slight improvement on their results.Comment: Preliminary version in Proc. European Symposium on Algorithms, 200

A Better Good-Turing Estimator for Sequence Probabilities

We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of the underlying alphabet. In this setting, many letters are unseen and the empirical distribution tends to overestimate the probability of the observed letters. To overcome this problem, the traditional approach to probability estimation is to use the classical Good-Turing estimator. We introduce a natural scaling model and use it to show that the Good-Turing sequence probability estimator is not consistent. We then introduce a novel sequence probability estimator that is indeed consistent under the natural scaling model.Comment: ISIT 2007, to appea

Stable manifolds and homoclinic points near resonances in the restricted three-body problem

The restricted three-body problem describes the motion of a massless particle under the influence of two primaries of masses $1-\mu$ and $\mu$ that circle each other with period equal to $2\pi$. For small $\mu$, a resonant periodic motion of the massless particle in the rotating frame can be described by relatively prime integers $p$ and $q$, if its period around the heavier primary is approximately $2\pi p/q$, and by its approximate eccentricity $e$. We give a method for the formal development of the stable and unstable manifolds associated with these resonant motions. We prove the validity of this formal development and the existence of homoclinic points in the resonant region. In the study of the Kirkwood gaps in the asteroid belt, the separatrices of the averaged equations of the restricted three-body problem are commonly used to derive analytical approximations to the boundaries of the resonances. We use the unaveraged equations to find values of asteroid eccentricity below which these approximations will not hold for the Kirkwood gaps with $q/p$ equal to 2/1, 7/3, 5/2, 3/1, and 4/1. Another application is to the existence of asymmetric librations in the exterior resonances. We give values of asteroid eccentricity below which asymmetric librations will not exist for the 1/7, 1/6, 1/5, 1/4, 1/3, and 1/2 resonances for any $\mu$ however small. But if the eccentricity exceeds these thresholds, asymmetric librations will exist for $\mu$ small enough in the unaveraged restricted three-body problem