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
An O(n log n) approximation scheme for Steiner tree in plan..:
Borradaile, Glencora
;
Klein, Philip
;
Mathieu, Claire
ACM Transactions on Algorithms (TALG). 5 (2009) 3 - p. 1-31 , 2009
Link:
https://dl.acm.org/doi/10.1145/1541885.1541892
RT Journal T1
An O(n log n) approximation scheme for Steiner tree in planar graphs
UL https://suche.suub.uni-bremen.de/peid=acm-1541892&Exemplar=1&LAN=DE A1 Borradaile, Glencora A1 Klein, Philip A1 Mathieu, Claire PB ACM YR 2009 SN 1549-6325 SN 1549-6333 K1 Steiner tree K1 approximation scheme K1 planar graphs K1 Theory of computation K1 Design and analysis of algorithms JF ACM Transactions on Algorithms (TALG) VO 5 IS 3 SP 1 OP 31 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/1541885.1541892 DO https://dl.acm.org/doi/10.1145/1541885.1541892 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)