- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: arXiv:2111.06299 (2021)
- Event
-
Veröffentlichung
- (where)
-
Hamburg
- (who)
-
Universitätsbibliothek der Technischen Universität Hamburg
- (when)
-
2021
- Creator
- DOI
-
10.15480/882.4142
- URN
-
urn:nbn:de:gbv:830-882.0146304
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:20 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Chalermsook, Parinya
- Kaul, Matthias
- Mnich, Matthias
- Spoerhase, Joachim
- Uniyal, Sumedha
- Vaz, Daniel
- Universitätsbibliothek der Technischen Universität Hamburg
Time of origin
- 2021
Other Objects (12)
Approximating distributed graph algorithms
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Approximating the double-cut-and-join distance between unsigned genomes
Hanani-Tutte for approximating maps of graphs
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Cut problems on graphs
Approximating Node-Weighted k-MST on Planar Graphs
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
Combinatorial refinement on circulant graphs
Combinatorial Algorithms for Graph Sparsification
Random graphs and combinatorial structures :
Random graphs and combinatorial structures :
Approximating distributed graph algorithms
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Approximating the double-cut-and-join distance between unsigned genomes
Hanani-Tutte for approximating maps of graphs
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Cut problems on graphs
Approximating Node-Weighted k-MST on Planar Graphs
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
Combinatorial refinement on circulant graphs
Combinatorial Algorithms for Graph Sparsification
Random graphs and combinatorial structures :
Random graphs and combinatorial structures :
Approximating distributed graph algorithms
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Approximating the double-cut-and-join distance between unsigned genomes
Hanani-Tutte for approximating maps of graphs
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Cut problems on graphs
Approximating Node-Weighted k-MST on Planar Graphs
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
Combinatorial refinement on circulant graphs
Combinatorial Algorithms for Graph Sparsification
Random graphs and combinatorial structures :