The task allocation problem with constant communication - Fernandez de la Vega, W.; Lamari, M. (Discrete Applied Mathematics, 2003)
Keywords: Applied sciences; Combinatorics; Combinatorics. Ordered structures; Computer science; control theory; systems; Computer systems performance. Reliability; Exact sciences and technology; Graph theory; Mathematics; Operational research and scientific management; Operational research. Management science; Polynomial time approximation scheme; Scheduling; Scheduling, sequencing; Sciences and techniques of general use; Software; Polynomial time approximation scheme; Scheduling; Polynomial; Costs; Processor; Scheme; Polynomial approximation; Complete; Constant; Numerical approximation; Assignment; Allocation; Number; Optimal allocation; Bipartite graph; Communication; Edge(graph); Approximation; Complete graph; Graph clique; Graph theory; Algorithm; Cost control; Polynomial time; Problem; Communication graph; Module; Edge; Graph algorithm