Multiplicative auction algorithm for approximate maximum weight bipartite matching (Q6086023)

scientific article; zbMATH DE number 7763034

Language	Label	Description	Also known as
English	Multiplicative auction algorithm for approximate maximum weight bipartite matching	scientific article; zbMATH DE number 7763034

Statements

instance of

scholarly article

0 references

title

Multiplicative auction algorithm for approximate maximum weight bipartite matching (English)

0 references

0 references

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

9 November 2023

0 references

full work available at URL

https://arxiv.org/abs/2301.09217

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence

0 references

A new algorithm for the assignment problem

0 references

Q4607903

0 references

Linear-Time Approximation for Maximum Weight Matching

0 references

Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture

0 references

A nearly linear-time PTAS for explicit fractional packing and covering linear programs

0 references

Q5519710

0 references

Algorithms for the Assignment and Transportation Problems

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

Q4598189

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

10.1007/978-3-031-32726-1_32

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6086023