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
Near-Optimal Dynamic Rounding of Fractional Matchings in Bi..:
, In:
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
,
Bhattacharya, Sayan
;
Kiss, Peter
;
Sidford, Aaron
. - p. 59-70 , 2024
Link:
https://dl.acm.org/doi/10.1145/3618260.3649648
RT T1
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
: T1
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
UL https://suche.suub.uni-bremen.de/peid=acm-3649648&Exemplar=1&LAN=DE A1 Bhattacharya, Sayan A1 Kiss, Peter A1 Sidford, Aaron A1 Wajc, David PB ACM YR 2024 K1 Data Structures K1 Dynamic Algorithms K1 Dynamic Matching K1 Theory of computation K1 Dynamic graph algorithms SP 59 OP 70 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3618260.3649648 DO https://dl.acm.org/doi/10.1145/3618260.3649648 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)