\(k\)-violation linear programming
type: Item
instance of: scholarly article
title: \(k\)-violation linear programming
zbMATH Open document ID: 0816.90103
DOI: 10.1016/0020-0190(94)00134-0
author: Thomas Roos
author: Peter Widmayer
published in: Information Processing Letters
publication date: 1995-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 681762
zbMATH Keywords: computational geometry
zbMATH Keywords: \(k\)-violation linear programming
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00134-0
OpenAlex ID: W2074818189
cites work: Applications of random sampling in computational geometry. II
cites work: On k-Hulls and Related Problems
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: Q3844775
cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
cites work: Q3772828
cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
cites work: Constructing Belts in Two-Dimensional Arrangements with Applications
cites work: A new polynomial-time algorithm for linear programming
cites work: Polynomial algorithms in linear programming
cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
cites work: Randomized optimal algorithm for slope selection
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: On levels in arrangements and Voronoi diagrams
cites work: An upper bound on the number of planar \(K\)-sets
description: scientific article; zbMATH DE number 681762