Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

Given a graph G = (V, E), a weight function w: E → R⁺, and a parameter k, we consider the problem of finding a subset U  V of size k that maximizes: Max-Vertex Cover_k: the weight of edges incident with vertices in U,Max-Dense Subgraph_k: the weight of edges in the subgraph induced by U,Max-Cut_k: the weight of edges cut by the partition (U, V\U),Max-Uncut_k: the weight of edges not cut by the partition (U, V\U).For each of the above problems we present approximation algorithms based on semidefinite programming and obtain approximation ratios better than those previously published. In particular we show that if a graph has a vertex cover of size k, then one can select in polynomial time a set of k vertices that covers over 80% of the edges.     

Equivalence of permutation polytopes corresponding to strictly supermodular functions

This paper demonstrates a strong equivalence of all permutation polytopes corresponding to strictly supermodular functions.     

Light transmission through a circular metallic grating under broadband radial and azimuthal polarization illumination

We studied the characteristics of a circular metallic grating illuminated by broadband radial and azimuthal polarizations. We demonstrated that this scenario is the cylindrical analogue of a one-dimensional Cartesian grating illuminated by TM and TE polarizations. We measured the transmission spectra of this structure and observed strong polarization selectivity and, specifically, a resonance for radial polarization excitation, indicating a strong coupling to surface plasmons. The structure may be attractive for applications where pure radial polarization is needed, such as tight focusing, material processing, and particle trapping.     

Randomized broadcast in networks

In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.     

Enhanced light‐vapor interactions and all optical switching in a chip scale micro‐ring resonator coupled with atomic vapor

The coupling of atomic and photonic resonances serves as an important tool for enhancing light‐matter interactions and enables the observation of multitude of fascinating and fundamental phenomena. Here, by exploiting the platform of atomic‐cladding wave guides, the resonant coupling of rubidium vapor and an atomic cladding micro ring resonator is experimentally demonstrated. Specifically, cavity‐atom coupling in the form of Fano resonances having a distinct dependency on the relative frequency detuning between the photonic and the atomic resonances is observed. Moreover, significant enhancement of the efficiency of all optical switching in the V‐type pump‐probe scheme is demonstrated. The coupled system of micro‐ring resonator and atomic vapor is a promising building block for a variety of light vapor experiments, as it offers a very small footprint, high degree of integration and extremely strong confinement of light and vapor. As such it may be used for important applications, such as all optical switching, dispersion engineering (e.g. slow and fast light) and metrology, as well as for the observation of important effects such as strong coupling, and Purcell enhancement.

     

A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination

We generalize a static two-agent location problem into dynamic, asymmetric settings. The dynamics is due to the ability of the agents to move at limited speeds. Since each agent has its own objective (demand) function and these functions are interdependent, decisions made by each agent may affect the performance of the other agent and thus affect the overall performance of the system. We show that, under a broad range of system’s parameters, centralized (system-wide optimal) and non-cooperative (Nash) behavior of the agents are characterized by a similar structure. The timing of these trajectories and the intermediate speeds are however different. Moreover, non-cooperative agents travel more and may never rest and thus the system performance deteriorates under decentralized decision-making. We show that a static linear reward approach, recently developed in Golany and Rothblum (Nav. Res. Logist. 53(1):1–15, 2006), can be generalized to provide coordination of the moving agents and suggest its dynamic modification. When the reward scheme is applied, the agents are induced to choose the system-wide optimal solution, even though they operate in a decentralized decision-making mode.     

Localizing combinatorial properties of partitions

The purpose of this paper is to develop a framework for the analysis of combinatorial properties of partitions. Our focus is on the relation between global properties of partitions and their localization to subpartitions. First, we study properties that are characterized by their local behavior. Second, we determine sufficient conditions for classes of partitions to have a member that has a given property. These conditions entail the possibility of being able to move from an arbitrary partition in the class to one that satisfies the given property by sequentially satisfying local variants of the property. We apply our approach to several properties of partitions that include consecutiveness, nestedness, order-consecutiveness, full nestedness and balancedness, and we demonstrate its usefulness in determining the existence of optimal partitions that satisfy such properties.     

A conforming decomposition theorem,a piecewise linear theorem of the alternative,and scalings of matrices satisfying lower and upper bounds

A scaling of a nonnegative matrixA is a matrixXAY ^?1, whereX andY are nonsingular, nonnegative diagonal matrices. Some condition may be imposed on the scaling, for example, whenA is square,X=Y or detX=detY. We characterize matrices for which there exists a scaling that satisfies predetermined upper and lower bound. Our principal tools are a piecewise linear theorem of the alternative and a theorem decomposing a solution of a system of equations as a sum of minimal support solutions which conform with the given solutions.     

Optimal stopping,exponential utility,and linear programming

This paper uses linear programming to compute an optimal policy for a stopping problem whose utility function is exponential. This is done by transforming the problem into an equivalent one having additive utility and nonnegative (not necessarily substochastic) transition matrices.Research was supported by NSF Grant ENG 76-15599.