Semideenite relaxations are used to approximate the problem of partitioning a graph into equally sized components. The relax-ations extend previous eigenvalue based models, and combine semidee-nite and polyhedral approaches. Computational results on graphs with several hundred vertices are given, and indicate that semideenite relax-ations approximate the equipartition problem quite well.

Semideenite relaxations are used to approximate the problem of partitioning a graph into equally sized components. The relaxations extend previous eigenvalue based models, and combine semideenite and polyhedral approaches. Computational results on graphs with several hundred vertices are given, and indicate that semideenite relaxations approximate the equipartition problem quite well.

We study three covering problems in the plane. Our original motivation for these come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up four unit-sized, axis-parallel squares. second build data structure on efficiently answer any query subtrajectory coverable unit-sized third problem compute longest that two

We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].

In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. Key-Words: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing. (Forthco...

To solve the energy-efficient virtual network embedding problem, this study proposes an algorithm based on Hopfield neural network. An model was established. Wavelet diffusion performed to take structural feature value into consideration and provide a candidate set for embedding. In addition, used in problem. The augmented Lagrangian multiplier method transform constraint problem unconstrained ...

Almost all previous dynamic-sized lock-free data structures are either unable to free memory to the memory allocator when it is no longer required, or require special system or hardware support. In the only exception we are aware of, a single thread failure can prevent further memory reclamation (see full paper for reference). We recently posed a problem — the Repeat Offenders Problem (ROP) — a...

We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same size. Using auditing methods developed for use with equal-sized precincts can, however, be inefficient or result in loss of statistical confidence when applied to elections with variable-sized precincts. We survey, eval...

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)(log log n)) deterministic time 2.8334-approximation algorithm for this problem. Previous approximation algorithms [7, 3, 6], when used to achieve the same approximation ratio for the disc covering problem, will have much higher time complexity than our algorithms.