Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Separation between Estimation and Approximation

From MaRDI portal
Publication:2989040
Jump to:navigation, search

DOI10.1145/2688073.2688101zbMath1364.68227OpenAlexW2063369774MaRDI QIDQ2989040

Shlomo Jozeph

Publication date: 19 May 2017

Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2688073.2688101


zbMATH Keywords

linear programmingroundingintegrality gapTFNP


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)


Related Items (1)

Almost-smooth histograms and sliding-window graph algorithms







This page was built for publication: Separation between Estimation and Approximation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2989040&oldid=16000035"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki