We propose a content aware scheduler to allocate resources for video delivery on the downlink of a Long Term Evolution (LTE) network. We consider multiple users subscribe to a video streaming service, and request videos encoded in H.264 Scalable Video Coding format. The scheduler maximizes the average video quality across all users by assigning resource blocks based on their device capabilities...

We study a natural class of flow problems that occur in the context of wireless networks; the objective is to maximize the flow from a set of sources to one sink node within a given time limit, while satisfying a number of constraints. These restrictions include capacities and transit times for edges; in addition, every node has a bound on the amount of transmission it can perform, due to limit...

We give a complete characterization of the two-state anti-ferromagnetic spin systems whichare of strong spatial mixing on general graphs. We show that a two-state anti-ferromagneticspin system is of strong spatial mixing on all graphs of maximum degree at most ∆ if and onlyif the system has a unique Gibbs measure on infinite regular trees of degree up to ∆, where∆ can be either ...

In this thesis we develop FPTASs for the counting problems of m−tuples, contingency tables with two rows, and 0/1 knapsack. For the problem of counting m−tuples, we design two algorithms, one is strongly polynomial. As far as we know, these are the first FPTASs for this problem. For the problem of counting contingency tables we improve significantly over the running time of existing algorithms....

We consider a linear complementarity problem (LCP) arisen from the Arrow-Debreu-Leontief competitive economy equilibrium where the LCP coefficient matrix is symmetric. We prove that the decision problem, to decide whether or not there exists a complementary solution, is NP-complete. Under certain conditions, an LCP solution is guaranteed to exist and we present a fully polynomial-time approxima...

We study the power of polynomial-time truthful mechanisms comparing to polynomial time (non-truthful) algorithms. We show that there is a setting in which deterministic polynomialtime truthful mechanisms cannot guarantee a bounded approximation ratio, but a non-truthful FPTAS exists. We also show that in the same setting there is a universally truthful randomized mechanism that provides an appr...

A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...

Feasibility tests determine whether it is possible for a given real-time system to always meet all of its timing constraints on a specified processing platform. Current feasibility tests for the uniprocessor static-priority scheduling of sporadic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priorit...

In the strip packing problem, a given set of axis-aligned rectangles must be packed into a fixed-width strip, and the goal is to minimize the height of the strip. In this paper, we examine a variant in which each rectangle may be cut vertically into multiple slices and the slices may be packed into the strip as individual pieces. Our results are: (1) analysis of the approximation ratio of sever...