Analytical aspects of tie breaking
type: Item
instance of: scholarly article
title: Analytical aspects of tie breaking
zbMATH Open document ID: 1253.68377
author: Tobias Jacobs
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6122470
zbMATH Keywords: perturbation
zbMATH Keywords: robust algorithms
zbMATH Keywords: proof technique
zbMATH Keywords: degeneracy
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.09.026
OpenAlex ID: W2085799750
cites work: A general approach to the analysis of controlled perturbation algorithms
cites work: Algorithms - ESA 2003
cites work: Q4335189
cites work: A General Approach to Removing Degeneracies
cites work: Efficient perturbations for handling geometric degeneracies
cites work: Resolving degeneracy in quadratic programming
cites work: Controlled perturbation for Delaunay triangulations
cites work: On degeneracy in linear programming and related problems
cites work: A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
cites work: The nature and meaning of perturbations in geometric computing
cites work: A Technique for Resolving Degeneracy in Linear Programming
cites work: Symbolic treatment of geometric degeneracies
DOI: 10.1016/J.TCS.2012.09.026
description: scientific article; zbMATH DE number 6122470