An Exact Performance Bound for an ${O (m+n)}$ Time Greedy Matching Procedure

AN EXACT PERFORMANCE BOUND FOR AN O(m+ n) TIME GREEDY MATCHING PROCEDURE

We prove an exact lower bound on γ(G), the size of the smallest matching that a certain O(m+ n) time greedy matching procedure may find for a given graph G with n vertices and m edges. The bound is precisely Erdös and Gallai’s extremal function that gives the size of the smallest maximum matching, over all graphs with n vertices and m edges. Thus the greedy procedure is optimal in the sense tha...

AN EXACT PERFORMANCE BOUND FOR AN O ( m + n ) TIMEGREEDY MATCHING

We prove an exact lower bound on (G), the size of the smallest matching that a certain O(m + n) time greedy matching procedure may nd for a given graph G with n vertices and m edges. The bound is precisely Erdd os and Gallai's extremal function that gives the size of the smallest maximum matching, over all graphs with n vertices and m edges. Thus the greedy procedure is optimal in the sense tha...

An Automatic Real Time Impedance Matching System for Use in an RF Electrostatics Accelerator Ion Source

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

An Exact Characterization of Greedy Structures

We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the partial characterizations of Rado, Gale, and Edmonds (matroids), and of Korte and Lovasz (greedoids). We show that the greedy algorithm optimizes all linear objective functions if and only if the problem structure (phrase...