Average-case analysis of the double description method and the beneath-beyond algorithm

DOI10.1007/S00454-006-1257-8MaRDI QIDQ878061zbMATH OpenOpenAlexFDO

Authors K. H. Borgwardt

Publication date 26 April 2007

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-006-1257-8

Mathematics Subject Classification ID

Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General convexity (52A99)

Recommendations

• scientific article; zbMATH DE number 4041254
• scientific article; zbMATH DE number 986985
• Average case analysis of the Boyer‐Moore algorithm
• Average-case analysis of algorithms. Dedicated to Philippe Flajolet on the occasion of his 50th birthday
• Average case analysis of Brzozowski's algorithm
• Average-case analysis of best-first search in two representative directed acyclic graphs
• Average-case analysis of some plurality algorithms
• Average-case analysis of algorithms using Kolmogorov complexity
• scientific article; zbMATH DE number 4014028
• Average-case analysis of the modified harmonic algorithm

Cited in

(5)

• Double description method revisited
• Beneath-and-Beyond revisited
• Computing convex hulls and counting integer points with \texttt{polymake}
• Doubly random polytopes
• The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model

Describes a project that uses

Uses Software

• Hull

This page was built for publication: Average-case analysis of the double description method and the beneath-beyond algorithm

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