Title
On Approximating a Scheduling Problem
Abstract
for Approx98)Pierluigi CrescenziDipartimento di Sistemi e InformaticaUniversit`a degli Studi di FirenzeVia C. Lombroso 6/17, 50134 Firenze, ItalyE-mail: piluc@dsi.unifi.it Fax: +39-55-4796730Deng XiaotieDepartment of Computer ScienceCity University of Hong KongKowloon, Hong Kong SAR, ChinaE-mail: deng@cs.cityu.edu.hkChristos H. PapadimitriouComputer Science DivisionUniversity of California at BerkeleySoda Hall 689, Berkeley CA 94720, U.S.A.E-mail: christos@cs.berkeley.edu...
Year
DOI
Venue
2001
10.1023/A:1011441109660
J. Comb. Optim.
Keywords
Field
DocType
parallel computation,communication,bipartite graph,edge coloring
Approximation algorithm,Edge coloring,Combinatorics,Mathematical optimization,Preemption,Job shop scheduling,Scheduling (computing),Heuristic (computer science),Computer science,Bipartite graph,Algorithm,Message passing
Journal
Volume
Issue
ISSN
5
3
1573-2886
Citations 
PageRank 
References 
19
0.98
7
Authors
3
Name
Order
Citations
PageRank
Pierluigi Crescenzi1100295.31
Xiaotie Deng23887340.99
Christos H. Papadimitriou3166713192.54