Multilist layering: Complexity and applications

DOI10.1016/0304-3975(94)00213-3MaRDI QIDQ673793zbMATH OpenOpenAlexFDO

Authors Anders Dessmark, Andrzej Lingas, Anil Maheshwari

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00213-3

zbMATH Keywords

convex layer problemmultilist layering

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 512837
• Layered graphs: applications and algorithms
• Layered graph approaches for combinatorial optimization problems
• Multivariate complexity theory
• scientific article; zbMATH DE number 1163111
• scientific article; zbMATH DE number 3995740
• The computational complexity of multi-level linear programs
• The complexity of the list homomorphism problem for graphs
• The complexity of the list homomorphism problem for graphs
• Complexity and fast algorithms for multiexponentiations

Cites work

• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• Efficient parallel convex hull algorithms
• Efficient piecewise-linear function approximation using the uniform metric
• On the convex layers of a planar set
• Upper envelope onion peeling

Cited in

(1)

• Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.

This page was built for publication: Multilist layering: Complexity and applications

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