The complexity of facets resolved

descriptionPublicationkeyboard_double_arrow_right Article , Conference object , Report 01 Jan 1985 United States Publisher:IEEEJournal:26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

Authors: Papadimitriou, Christos H.; Wolfe, David;

doi: 10.1109/sfcs.1985.56 , 10.1016/0022-0000(88)90042-6

handle: 1813/6542

The complexity of facets resolved

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

United States

Related Organizations

National Technical University of Athens
Greece
Stanford University
United States
University of California, Berkeley
United States
Cornell University
United States

Keywords

Combinatorial optimization, Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, traveling salesman problem polytope, computer science, technical report, facets, Theoretical Computer Science, Computational Theory and Mathematics, polyhedral combinatorics, D p-complete

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	130
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average