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
A polynomial time approximation scheme for minimum routing ..:
, In:
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
,
Wu, Bang Ye
;
Lancia, Giuseppe
;
Bafna, Vineet
... - p. 21-32 , 1998
Link:
https://dl.acm.org/doi/10.5555/314613.314628
RT T1 <cTitle>Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms</cTitle>: T1 <Title>A polynomial time approximation scheme for minimum routing cost spanning trees</Title> UL https://suche.suub.uni-bremen.de/peid=acm-314628&Exemplar=1&LAN=DE A1 Wu, Bang Ye A1 Lancia, Giuseppe A1 Bafna, Vineet A1 Chao, Kun-Mao A1 Ravi, R. A1 Tang, Chuan Yi PB Society for Industrial and Applied Mathematics YR 1998 K1 Mathematics of computing K1 Mathematical analysis K1 Functional analysis K1 Approximation K1 Theory of computation K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Discrete mathematics K1 Routing and network design problems SP 21 OP 32 LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/314613.314628 DO https://dl.acm.org/doi/10.5555/314613.314628 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
