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 connectivity domination in weighted bounded-g..:
, In:
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
,
Cohen-Addad, Vincent
;
Colin de Verdière, Éric
;
Klein, Philip N.
.. - p. 584-597 , 2016
Link:
https://dl.acm.org/doi/10.1145/2897518.2897635
RT T1
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
: T1
Approximating connectivity domination in weighted bounded-genus graphs
UL https://suche.suub.uni-bremen.de/peid=acm-2897635&Exemplar=1&LAN=DE A1 Cohen-Addad, Vincent A1 Colin de Verdière, Éric A1 Klein, Philip N. A1 Mathieu, Claire A1 Meierfrankenfeld, David PB ACM YR 2016 K1 Approximation algorithm K1 bounded genus K1 connected dominating set K1 feedback vertex set K1 graph K1 planar graph K1 polynomial-time approximation scheme K1 Theory of computation K1 Design and analysis of algorithms K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory SP 584 OP 597 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2897518.2897635 DO https://dl.acm.org/doi/10.1145/2897518.2897635 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)