In this paper, we show that a simple distributed algorithm for network scheduling in arbitrary m processor networks with unit capacity links is an O(logm)-approximation algorithm if the optimal schedule length is su ciently large. We will assume that there are m machines or processors labeled p1; p2; : : : ; pm, such that processor pi has ji jobs and P i ji = n. Let d be the maximum degree in t...

In communication networks, structure and dynamics are tightly coupled. The structure controls the flow of information and is itself shaped by the dynamical process of information exchanged between nodes. In order to reconcile structure and dynamics, a generic model, based on the local interaction between nodes, is considered for the communication in large social networks. In agreement with data...

This paper deals with the modeling of punching shear failure in reinforced concrete slabs using nonlinear finite element analysis. The 3D finite element analyses (FEA) were performed with the appropriate modeling of element size and mesh, and the constitutive modeling of concrete. The FE numerical models are validated by comparing with the experimental results obtained from tested specimens and...

Capacity-Achieving Schemes for Finite-State Channels

We prove a lower bound on the optimal price for a fairly large class of blocking systems with general arrival and service processes, determine optimal price expressions for M/M/1/m and M/GI/s/s systems, and investigate how optimal prices change with changes in the size of the waiting room and service

We give the first non-trivial approximation algorithm for the Capacitated Dial-a-Ride problem: given a collection of objects located at points in a metric space, a specified destination point for each object, and a vehicle with a capacity of at most k objects, the goal is to compute a shortest tour for the vehicle in which all objects can be delivered to their destinations while ensuring that t...

A Voronoi diagram of a set of n sites partitions a finite set of m points into regions of different areas, called the capacities of the sites. In this paper we are interested in Voronoi diagrams in which the capacities are given as constraints. We compute such capacity-constrained Voronoi diagrams in finite spaces by starting with an arbitrary partition that fulfills the capacity constraint wit...