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 Small Sparse Cuts:
, In:
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
,
Anand, Aditya
;
Lee, Euiwoong
;
Li, Jason
. - p. 319-330 , 2024
Link:
https://dl.acm.org/doi/10.1145/3618260.3649747
RT T1 <cTitle>Proceedings of the 56th Annual ACM Symposium on Theory of Computing</cTitle>: T1 <Title>Approximating Small Sparse Cuts</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3649747&Exemplar=1&LAN=DE A1 Anand, Aditya A1 Lee, Euiwoong A1 Li, Jason A1 Saranurak, Thatchaphol PB ACM YR 2024 K1 Approximation algorithms K1 Cut-matching game K1 Sample sets K1 Small Set Expansion K1 Sparsest Cut K1 Theory of computation K1 Routing and network design problems K1 Network flows SP 319 OP 330 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3618260.3649747 DO https://dl.acm.org/doi/10.1145/3618260.3649747 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
