We design approximation algorithms for Unique Games when the constraint graph admits good low diameter graph decomposition. For the Max-2Link problem in Kr-minor free graphs, when there is an assignment satisfying 1 − ε fraction of constraints, we present an algorithm that produces an assignment satisfying 1−O(rε) fraction of constraints, with the approximation ratio independent of the alphabet...

We study the problem of maximizing a monotone submodular function subject to Multiple Knapsack constraint. The input is set I items, each has non-negative weight, and bins arbitrary capacities. Also, we are given submodular, f over subsets items. objective find packing subset items A⊆I in such that f(A) maximized. Our main result an almost optimal polynomial time (1−e−1−ε)-approximation algorit...

Addressing an integrated decision-making structure for planting and harvesting scheduling may lead to more realistic, accurate, and efficient decision in fresh product supply chain. This study aims to develop an integrated bi-objective tactical and operational planning model for producing and distributing fresh crops. The first objective of the model is to maximize total revenue of supply chain...

The mixed-order eigenvalue problem −δ∆u + ∆u + λu = 0 with δ > 0, modeling small amplitude vibrations of a thin plate, is analyzed in a bounded 2-D domain Ω that contains a single small hole of radius ε centered at some x0 ∈ Ω. Clamped conditions are imposed on the boundary of Ω and on the boundary of the small hole. In the limit ε → 0, and for δ = O(1), the limiting problem for u must satisfy ...

in the course of expansion in turbines steam nucleates to become a two-phase mixture, the liquid consisting of a very large number of extremely small droplets carried by the vapor. formation and subsequent behaviour of the liquid lowers the performance of turbine wet stages. the calculations were carried out assuming that the flow is two dimensional, compressible, turbulent and viscous. a class...

An instance of a constraint satisfaction problem (CSP) is variable k-consistent if any subinstance with at most k variables has a solution. For a fixed constraint language L, ρk(L) is the largest ratio such that any variable k-consistent instance has a solution that satisfies at least a fraction of ρk(L) of the constraints. We provide an expression for the limit ρ(L) := limk→∞ ρk(L), and show t...

In this paper, we study scalable algorithms for influence maximization with general marketing strategies (IM-GMS), in which a marketing strategy mix is modeled as a vector x = (x1, . . . , xd) and could activate a node v in the social network with probability hv(x). The IM-GMS problem is to find the best strategy mix x∗ that maximize the influence spread due to influence propagation from the ac...

We focus on the minimal time control problem for single-input control-affine systems ẋ = X(x) + u1Y1(x) in IR with fixed initial and final time conditions x(0) = x̂0, x(t f ) = x̂1, and where the scalar control u1 satisfies the constraint |u1(·)| 6 1. For these systems a concept of conjugate time tc has been defined in e.g. [3, 30, 33] in the bang-bang case. Besides, theoretical and practical iss...