The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Paper info

Carsten Lund, Mihalis Yannakakis
On the hardness of approximating minimization problems. [Citation Graph (1, 0)][DBLP]
STOC, 1993, pp:286-293 [Conf]

Scores and Rank
SCEAS: 0.49819
SCEAS_PS: 0.01430
SCEAS_BPS: 0.03846
SCEAS_EPS: 0.03548
SCEAS_BEPS: 0.07836
SCEAS_B0: 3.19081
PAGE_RANK: 0.52793
HITS_H: 0
HITS_A: 0.00253
BHITS_H: 0
BHITS_A: 0.00007
SALSA_A: 0.16556
SALSA_H: 0
BSALSA_A: 0.04229
BSALSA_H: 0
P: 0.00000
BCC: 0.08354
citations_to_me: 1
citations_from_me: 0



Graph produced by graphviz-1.8.5
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002