Work

Buy-at-bulk network design

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1997.646143

Authors: B. Awerbuch, Y. Azar

Institutions: Johns Hopkins University, Tel Aviv University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2133156969

FWCI: 8.751

Cites: 14

Cited by: 179

Related to: 9