Improved Deterministic Algorithms for Weighted Matching and Packing Problems

2009 ◽  
pp. 211-220 ◽  
Author(s):  
Qilong Feng ◽  
Yang Liu ◽  
Songjian Lu ◽  
Jianxin Wang
Keyword(s):  
Packing Problems ◽  
Weighted Matching ◽  
Deterministic Algorithms

scholarly journals Improved deterministic algorithms for weighted matching and packing problems

2011 ◽  
Vol 412 (23) ◽  
pp. 2503-2512 ◽  
Author(s):  
Jianer Chen ◽  
Qilong Feng ◽  
Yang Liu ◽  
Songjian Lu ◽  
Jianxin Wang
Keyword(s):  
Packing Problems ◽  
Weighted Matching ◽  
Deterministic Algorithms

scholarly journals Parameterized algorithms for weighted matching and packing problems

2008 ◽  
Vol 5 (4) ◽  
pp. 748-754 ◽  
Author(s):  
Jianxin Wang ◽  
Yunlong Liu
Keyword(s):  
Parameterized Algorithms ◽  
Packing Problems ◽  
Weighted Matching

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets

2015 ◽  
Vol 29 (4) ◽  
pp. 1815-1836 ◽  
Author(s):  
Prachi Goyal ◽  
Neeldhara Misra ◽  
Fahad Panolan ◽  
Meirav Zehavi
Keyword(s):  
Packing Problems ◽  
Deterministic Algorithms

scholarly journals Maximum Likelihood Analysis of Rare Binary Traits Under Different Modes of Inheritance

Genetics ◽  
1996 ◽  
Vol 143 (4) ◽  
pp. 1819-1829 ◽  
Author(s):  
G Thaller ◽  
L Dempfle ◽  
I Hoeschele
Keyword(s):  
Maximum Likelihood ◽  
Mixed Model ◽  
Major Gene ◽  
Likelihood Ratio Statistic ◽  
Information Criterion ◽  
Genetic Models ◽  
Parameter Estimates ◽  
Gene Effects ◽  
Binary Traits ◽  
Deterministic Algorithms

Abstract Maximum likelihood methodology was applied to determine the mode of inheritance of rare binary traits with data structures typical for swine populations. The genetic models considered included a monogenic, a digenic, a polygenic, and three mixed polygenic and major gene models. The main emphasis was on the detection of major genes acting on a polygenic background. Deterministic algorithms were employed to integrate and maximize likelihoods. A simulation study was conducted to evaluate model selection and parameter estimation. Three designs were simulated that differed in the number of sires/number of dams within sires (10/10, 30/30, 100/30). Major gene effects of at least one SD of the liability were detected with satisfactory power under the mixed model of inheritance, except for the smallest design. Parameter estimates were empirically unbiased with acceptable standard errors, except for the smallest design, and allowed to distinguish clearly between the genetic models. Distributions of the likelihood ratio statistic were evaluated empirically, because asymptotic theory did not hold. For each simulation model, the Average Information Criterion was computed for all models of analysis. The model with the smallest value was chosen as the best model and was equal to the true model in almost every case studied.

scholarly journals Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices

2021 ◽  
Author(s):  
Stefano Massei
Keyword(s):  
Computer Science ◽  
Recent Work ◽  
Linear Algebra ◽  
Optimization Problems ◽  
Approximation Error ◽  
Positive Semidefinite ◽  
Numerical Linear Algebra ◽  
Maximum Volume ◽  
Deterministic Algorithms ◽  
Principal Submatrix

AbstractVarious applications in numerical linear algebra and computer science are related to selecting the $$r\times r$$ r × r submatrix of maximum volume contained in a given matrix $$A\in \mathbb R^{n\times n}$$ A ∈ R n × n . We propose a new greedy algorithm of cost $$\mathcal O(n)$$ O ( n ) , for the case A symmetric positive semidefinite (SPSD) and we discuss its extension to related optimization problems such as the maximum ratio of volumes. In the second part of the paper we prove that any SPSD matrix admits a cross approximation built on a principal submatrix whose approximation error is bounded by $$(r+1)$$ ( r + 1 ) times the error of the best rank r approximation in the nuclear norm. In the spirit of recent work by Cortinovis and Kressner we derive some deterministic algorithms, which are capable to retrieve a quasi optimal cross approximation with cost $$\mathcal O(n^3)$$ O ( n 3 ) .

scholarly journals Scaling Algorithms for Weighted Matching in General Graphs

2018 ◽  
Vol 14 (1) ◽  
pp. 1-35 ◽  
Author(s):  
Ran Duan ◽  
Seth Pettie ◽  
Hsin-Hao Su
Keyword(s):  
Weighted Matching ◽  
Scaling Algorithms ◽  
General Graphs

scholarly journals Empowering the configuration-IP: new PTAS results for scheduling with setup times

2021 ◽  
Author(s):  
Klaus Jansen ◽  
Kim-Manuel Klein ◽  
Marten Maack ◽  
Malin Rau
Keyword(s):  
Approximation Scheme ◽  
Constant Factor ◽  
Setup Times ◽  
Linear Programs ◽  
Scheduling Problems ◽  
Design Of Algorithms ◽  
Packing Problems ◽  
Integer Linear Programs ◽  
One Machine ◽  
Target Locations

AbstractInteger linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems where a set of items has to be placed in multiple target locations. Herein, a configuration describes a possible placement on one of the target locations, and the IP is used to choose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of n-fold integer programming and, therefore, be solved efficiently. As an application, we consider scheduling problems with setup times in which a set of jobs has to be scheduled on a set of identical machines with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed, an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time $$f(1/\varepsilon )\cdot \mathrm {poly}(|I|)$$ f ( 1 / ε ) · poly ( | I | ) . Previously, only constant factor approximations of 5/3 and $$4/3 + \varepsilon $$ 4 / 3 + ε , respectively, were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.

scholarly journals Gaussian variant of Freivalds’ algorithm for efficient and reliable matrix product verification

2020 ◽  
Vol 26 (4) ◽  
pp. 273-284
Author(s):  
Hao Ji ◽  
Michael Mascagni ◽  
Yaohang Li
Keyword(s):  
False Positive ◽  
Measure Zero ◽  
Matrix Multiplication ◽  
Numerical Linear Algebra ◽  
Floating Point ◽  
Matrix Product ◽  
Computing Environment ◽  
Deterministic Algorithms ◽  
Product Verification ◽  
Point Arithmetic

AbstractIn this article, we consider the general problem of checking the correctness of matrix multiplication. Given three n\times n matrices 𝐴, 𝐵 and 𝐶, the goal is to verify that A\times B=C without carrying out the computationally costly operations of matrix multiplication and comparing the product A\times B with 𝐶, term by term. This is especially important when some or all of these matrices are very large, and when the computing environment is prone to soft errors. Here we extend Freivalds’ algorithm to a Gaussian Variant of Freivalds’ Algorithm (GVFA) by projecting the product A\times B as well as 𝐶 onto a Gaussian random vector and then comparing the resulting vectors. The computational complexity of GVFA is consistent with that of Freivalds’ algorithm, which is O(n^{2}). However, unlike Freivalds’ algorithm, whose probability of a false positive is 2^{-k}, where 𝑘 is the number of iterations, our theoretical analysis shows that, when A\times B\neq C, GVFA produces a false positive on set of inputs of measure zero with exact arithmetic. When we introduce round-off error and floating-point arithmetic into our analysis, we can show that the larger this error, the higher the probability that GVFA avoids false positives. Moreover, by iterating GVFA 𝑘 times, the probability of a false positive decreases as p^{k}, where 𝑝 is a very small value depending on the nature of the fault on the result matrix and the arithmetic system’s floating-point precision. Unlike deterministic algorithms, there do not exist any fault patterns that are completely undetectable with GVFA. Thus GVFA can be used to provide efficient fault tolerance in numerical linear algebra, and it can be efficiently implemented on modern computing architectures. In particular, GVFA can be very efficiently implemented on architectures with hardware support for fused multiply-add operations.

Combining genetic and deterministic algorithms for locating actuators on space structures

1996 ◽  
Vol 33 (3) ◽  
pp. 422-427 ◽  
Author(s):  
Hiroshi Furuya ◽  
Raphael T. Haftka
Keyword(s):  
Space Structures ◽  
Deterministic Algorithms
Sign in / Sign up

Export Citation Format

Share Document