Analytical aspects of tie breaking

DOI10.1016/j.tcs.2012.09.026zbMath1253.68377OpenAlexW2085799750MaRDI QIDQ1929235

Tobias Jacobs

Publication date: 7 January 2013

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.026

zbMATH Keywords

perturbationdegeneracyrobust algorithmsproof technique

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)

Related Items (1)

Improved approximation algorithms for the average-case tree searching problem

Cites Work

• Unnamed Item
• Unnamed Item
• A general approach to the analysis of controlled perturbation algorithms
• Resolving degeneracy in quadratic programming
• On degeneracy in linear programming and related problems
• Efficient perturbations for handling geometric degeneracies
• The nature and meaning of perturbations in geometric computing
• Symbolic treatment of geometric degeneracies
• A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
• A General Approach to Removing Degeneracies
• A Technique for Resolving Degeneracy in Linear Programming
• Algorithms - ESA 2003

This page was built for publication: Analytical aspects of tie breaking