Computational complexity of approximation algorithms for combinatorial problems

G. V. Gens; E. V. Levner

doi:10.1007/3-540-09526-8_26

Computational complexity of approximation algorithms for combinatorial problems

G. V. Gens, E. V. Levner

Russian Academy of Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

55 Scopus citations

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium
Editors	Jiri Becvar
Publisher	Springer Verlag
Pages	292-300
Number of pages	9
ISBN (Print)	9783540095262
DOIs	https://doi.org/10.1007/3-540-09526-8_26
State	Published - 1979
Externally published	Yes
Event	8th Symposium on Mathematical Foundations of Computer Science, MFCS 1979 - Olomouc, Serbia Duration: 3 Sep 1979 → 7 Sep 1979

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	74 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th Symposium on Mathematical Foundations of Computer Science, MFCS 1979
Country/Territory	Serbia
City	Olomouc
Period	3/09/79 → 7/09/79

Access to Document

10.1007/3-540-09526-8_26

Cite this

Gens, G. V., & Levner, E. V. (1979). Computational complexity of approximation algorithms for combinatorial problems. In J. Becvar (Ed.), Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium (pp. 292-300). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 74 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-09526-8_26

Gens, G. V. ; Levner, E. V. / Computational complexity of approximation algorithms for combinatorial problems. Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium. editor / Jiri Becvar. Springer Verlag, 1979. pp. 292-300 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{154ebc25e55a4bba9c939cca3818f6aa,

title = "Computational complexity of approximation algorithms for combinatorial problems",

author = "Gens, {G. V.} and Levner, {E. V.}",

year = "1979",

doi = "10.1007/3-540-09526-8_26",

language = "אנגלית",

isbn = "9783540095262",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "292--300",

editor = "Jiri Becvar",

booktitle = "Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium",

address = "גרמניה",

note = "8th Symposium on Mathematical Foundations of Computer Science, MFCS 1979 ; Conference date: 03-09-1979 Through 07-09-1979",

}

Gens, GV & Levner, EV 1979, Computational complexity of approximation algorithms for combinatorial problems. in J Becvar (ed.), Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 74 LNCS, Springer Verlag, pp. 292-300, 8th Symposium on Mathematical Foundations of Computer Science, MFCS 1979, Olomouc, Serbia, 3/09/79. https://doi.org/10.1007/3-540-09526-8_26

Computational complexity of approximation algorithms for combinatorial problems. / Gens, G. V.; Levner, E. V.
Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium. ed. / Jiri Becvar. Springer Verlag, 1979. p. 292-300 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 74 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computational complexity of approximation algorithms for combinatorial problems

AU - Gens, G. V.

AU - Levner, E. V.

PY - 1979

Y1 - 1979

UR - http://www.scopus.com/inward/record.url?scp=85013625593&partnerID=8YFLogxK

U2 - 10.1007/3-540-09526-8_26

DO - 10.1007/3-540-09526-8_26

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85013625593

SN - 9783540095262

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 292

EP - 300

BT - Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium

A2 - Becvar, Jiri

PB - Springer Verlag

T2 - 8th Symposium on Mathematical Foundations of Computer Science, MFCS 1979

Y2 - 3 September 1979 through 7 September 1979

ER -

Gens GV, Levner EV. Computational complexity of approximation algorithms for combinatorial problems. In Becvar J, editor, Mathematical Foundations of Computer Science 1979 - Proceedings, 8th Symposium. Springer Verlag. 1979. p. 292-300. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-09526-8_26

Computational complexity of approximation algorithms for combinatorial problems

Publication series

Conference

Access to Document

Other files and links

Cite this