scientific article
From MaRDI portal
Publication:3340631
zbMATH Open0547.90074MaRDI QIDQ3340631
Author name not available (Why is that?)
Publication date: 1983
Title of this publication is not available (Why is that?)
combinatorial optimizationapproximate algorithmstutorial paperepsilon-approximate polynomially bounded algorithm
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Permutations, words, matrices (05A05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items (5)
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms ⋮ On Approximate Solutions for Combinatorial Optimization Problems ⋮ Title not available (Why is that?) ⋮ Approximation algorithms for combinatorial optimization. International ICALP '98 workshop, APPROX '98, Aalborg, Denmark, July 18--19, 1998. Proceedings ⋮ Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340631)
