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
Approximating APSP without scaling: equivalence of approxim..:
, In:
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
,
Bringmann, Karl
;
Künnemann, Marvin
;
Węgrzycki, Karol
- p. 943-954 , 2019
Link:
https://dl.acm.org/doi/10.1145/3313276.3316373
RT T1
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
: T1
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
UL https://suche.suub.uni-bremen.de/peid=acm-3316373&Exemplar=1&LAN=DE A1 Bringmann, Karl A1 Künnemann, Marvin A1 Węgrzycki, Karol PB ACM YR 2019 K1 approximation schemes K1 fine-grained complexity K1 hardness of approximation K1 strongly polynomial algorithms K1 Theory of computation K1 Design and analysis of algorithms K1 Graph algorithms analysis K1 Shortest paths K1 Approximation algorithms analysis K1 Computational complexity and cryptography K1 Problems, reductions and completeness SP 943 OP 954 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3313276.3316373 DO https://dl.acm.org/doi/10.1145/3313276.3316373 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)