I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Efficient distributed approximation algorithms via probabil..:
, In:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
,
Khan, Maleq
;
Kuhn, Fabian
;
Malkhi, Dahlia
.. - p. 263-272 , 2008
Link:
https://dl.acm.org/doi/10.1145/1400751.1400787
RT T1 <cTitle>Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing</cTitle>: T1 <Title>Efficient distributed approximation algorithms via probabilistic tree embeddings</Title> UL https://suche.suub.uni-bremen.de/peid=acm-1400787&Exemplar=1&LAN=DE A1 Khan, Maleq A1 Kuhn, Fabian A1 Malkhi, Dahlia A1 Pandurangan, Gopal A1 Talwar, Kunal PB ACM YR 2008 K1 distributed approximation K1 generalized steiner forests K1 least element lists K1 metric spaces K1 network optimization K1 probabilistic tree embeddings K1 Theory of computation K1 Randomness, geometry and discrete structures K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Network flows K1 Graph algorithms K1 Design and analysis of algorithms K1 Graph algorithms analysis SP 263 OP 272 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/1400751.1400787 DO https://dl.acm.org/doi/10.1145/1400751.1400787 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
