We provide an algorithm for the exact computation of the lattice width of an integral polygon K in linear-time with respect to the size of K. Moreover, we describe how this new algorithm can be extended to an arbitrary dimension thanks to a greedy approach avoiding complex geometric processings.

We consider the adaptive influence maximization problem: given a network and budget k, iteratively select k seeds in to maximize expected number of adopters. In full-adoption feedback model, after selecting each seed, seed-picker observes all resulting adoptions. myopic only whether neighbor chosen seed adopts. Motivated by extreme success greedy-based algorithms/heuristics for maximization, we...

The study of stability problems of functional equations was motivated by a question of S.M. Ulam asked in 1940. The first result giving answer to this question is due to D.H. Hyers. Subsequently, his result was extended and generalized in several ways.We prove some hyperstability results for the equation g(ax+by)+g(cx+dy)=Ag(x)+Bg(y)on restricted domain. Namely, we show, under some weak natural...

Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Wellknown drawback of the greedy approach is that the chosen candidate is often not the optimal ...

We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n/ log d) hops. We study greedy routing over uni-dimensional metrics defined over n nodes lying in a ring. greedy routing in graph (V, E) with distance function δ : V × V → R entails the following decision: Given target node t, node u with neighbors N(u) forwards a message to v ∈ N(u) such th...

We consider tackling a single-agent RL problem by decomposing it to n learners. These learners are generally trained egocentrically: they are greedy with respect to their own local focus. In this extended abstract, we show theoretically and empirically that this leads to the presence of attractors: states attracting and detaining the agent, against what the global objective function would advise.

We introduce a natural generalization of both pseudotriangulations and multitriangulations, that we call multi-pseudotriangulations. We propose an enumeration algorithm for multi-pseudotriangulations, based on certain greedy multi-pseudotriangulations that are closely related with sorting networks. The proofs of the results of this extended abstract are skipped for space reasons.

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem of temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterize its competitive ratio in terms of the combinatorial properties of the graph representing t...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...