Approximating Maximum Weight Matching in Near-Linear Time

2010 ◽  
Author(s):  
Ran Duan ◽  
Seth Pettie
Keyword(s):  
Linear Time ◽  
Maximum Weight ◽  
Maximum Weight Matching

scholarly journals Linear-Time Approximation for Maximum Weight Matching

2014 ◽  
Vol 61 (1) ◽  
pp. 1-23 ◽  
Author(s):  
Ran Duan ◽  
Seth Pettie
Keyword(s):  
Linear Time ◽  
Maximum Weight ◽  
Time Approximation ◽  
Maximum Weight Matching

scholarly journals Validation of Automated Chromosome Recovery in the Reconstruction of Ancestral Gene Order

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 160
Author(s):  
Qiaoji Xu ◽  
Lingling Jin ◽  
James H. Leebens-Mack ◽  
David Sankoff
Keyword(s):  
Phylogenetic Tree ◽  
Gene Order ◽  
Evolutionary Process ◽  
Gene Content ◽  
Ancestral Genome ◽  
Maximum Weight ◽  
Ancestral Gene ◽  
Maximum Weight Matching

The RACCROCHE pipeline reconstructs ancestral gene orders and chromosomal contents of the ancestral genomes at all internal vertices of a phylogenetic tree. The strategy is to accumulate a very large number of generalized adjacencies, phylogenetically justified for each ancestor, to produce long ancestral contigs through maximum weight matching. It constructs chromosomes by counting the frequencies of ancestral contig co-occurrences on the extant genomes, clustering these for each ancestor and ordering them. The main objective of this paper is to closely simulate the evolutionary process giving rise to the gene content and order of a set of extant genomes (six distantly related monocots), and to assess to what extent an updated version of RACCROCHE can recover the artificial ancestral genome at the root of the phylogenetic tree relating to the simulated genomes.

scholarly journals Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 50
Author(s):  
Ali Ghiasian ◽  
Majid Jamali
Keyword(s):  
Randomized Algorithms ◽  
High Speed ◽  
Time Slot ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
High Complexity ◽  
Maximum Weight ◽  
Switch Architecture ◽  
Simulation Results ◽  
Maximum Weight Matching

<span>Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the well-known formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.</span>

Sign in / Sign up

Export Citation Format

Share Document