Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...

We continue the study of priority or “greedy-like” algorithms as initiated in [6] and as extended to graph theoretic problems in [8]. Graph theoretic problems pose some modelling problems that did not exist in the original applications of [6] and [2]. Following [8], we further clarify these concepts. In the graph theoretic setting there are several natural input formulations for a given problem...

Abs t rac t . In this note a greedy algorithm is considered that computes a matching for a graph with a given ordering of its vertices, and those graphs are studied for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulate...

We rst consider a `non-greedy' queueing system on a circle. We present a new and very simple proof of the stability of this system (under the appropriate condition) based on the average travel times between customers. Next we show that the same non-greedy system, with a restricted number of customers, converges weakly to this system when the restricted number goes to innnity. Finally we conside...

In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Pǎtraşcu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 an...

A neighbor system, introduced in this paper, is a collection of integral vectors in R with some special structure. Such collections (slightly) generalize jump systems, which, in turn, generalize integral bisubmodular polyhedra, integral polymatroids, delta-matroids, matroids, and other structures. We show that neighbor systems provide a systematic and simple way to characterize these structures...

One of the most critical tasks in Vehicular Ad-hoc Networks (VANETs) is broadcasting Emergency Messages (EMs) at considerable data delivery rates (DDRs). The enhanced spider-web-like Transmission Mechanism for Data (TMED) based on request spiders and authenticated to create shortest route path between source vehicle target vehicles. However, adjacent allocation DDR only it not clear whether eac...

Ordered Binary Decision Diagrams (OBDDs) are so far the most eecient representation scheme for manipulation of Boolean functions in computer-aided design and veriication of digital systems. The concise-ness of an OBDD representation depends on the choice of the variable ordering, and the minimization problem that can be formulated as the problem of nding an ordering that minimizse the OBDD size...

A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy changemaking algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has assembled the correct change. Pearson has prov...