Fast algorithms with algebraic Monge properties

DOI10.1007/3-540-45687-2_8MaRDI QIDQ4708562zbMATH OpenFDO

Authors Peter Brucker, Lawrence L. Larmore, James K. Park, Wolfgang W. Bein

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200104.htm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On some algebras connected with fast algorithms
• Fast Algorithms for Pseudoarboricity
• Fast algorithms for the characteristic polynomial
• Faster algorithms via approximation theory
• scientific article; zbMATH DE number 4205881
• On fast multiplication of polynomials over arbitrary algebras
• Fast matrix multiplication and its algebraic neighbourhood
• scientific article; zbMATH DE number 3978403
• Faster algorithms for the characteristic polynomial

Cited in

(5)

• The algebraic Monge property and path problems
• On the role of bottleneck Monge matrices in combinatorial optimization
• An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays
• Fast Combinatorial Algorithm for Tightly Separating Hyperplanes
• Fast Algorithms for Pseudoarboricity

This page was built for publication: Fast algorithms with algebraic Monge properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708562)