Middle ear diseases in relation to atopy and nasal metachromatic cell in infancy and Metachromatically cells in nasal mucosa after allergen challenge.Expand

This work presents a simple randomized linear time algorithm achieving a tight approximation guarantee of 1/2, thus matching the known hardness result of Feige et al.Expand

Improved approximations for two variants of the cardinality constraint for non-monotone functions are presented and a simple randomized greedy approach is presented where in each step a random element is chosen from a set of "reasonably good" elements.Expand

A simple randomized linear time algorithm achieving a tight approximation guarantee of 1/2 is presented, thus matching the known hardness result of Feige, Mirrokni, and Vondrak.Expand

This work presents a new unified continuous greedy algorithm which finds approximate fractional solutions for both the non-monotone and monotone cases, and improves on the approximation ratio for many applications.Expand

Datacenter WAN traffic consists of high priority transfers that have to be carried as soon as they arrive alongside large transfers with pre-assigned deadlines on their completion (ranging from… Expand

DatacenterWAN trac consists of high priority transfers that have to be carried as soon as they arrive, alongside large transfers with preassigned deadlines on their completion. e ability to oer… Expand

This work converts linear programming integrality gaps for the Multiway Cut, 0-Extension, and and Metric Labeling problems into UGC-based hardness results and suggests that if the unique games conjecture is true then a linear relaxation of the latter problems studied in several papers yields the best possible approximation.Expand

A 1/e-competitive algorithm for the unconstrained case in which the algorithm may hold any subset of the elements, and constant competitive ratio algorithms for the case where the algorithms may hold at most k elements in its solution.Expand

This work considers the k-balanced partitioning problem, where the goal is to partition the vertices of an input graph G into k equally sized components, while minimizing the total weight of the edges connecting different components, and presents a (bi-criteria) approximation algorithm achieving an approximation of O(log n log k), which matches or improves over previous algorithms for all relevant values of k.Expand