Monografie
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
- Sprache
-
Englisch
- Identifier
-
1251396690
- Beteiligte Personen und Organisationen
- DOI
-
10.15480/882.4142
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:58 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Monografie
Beteiligte
- Chalermsook, Parinya
- Kaul, Matthias
- Mnich, Matthias
- Spoerhase, Joachim
- Uniyal, Sumedha
- Vaz, Daniel
Ähnliche Objekte (12)
Approximating distributed graph algorithms
Hanani-Tutte for approximating maps of graphs
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Polytopes with few coordinate values : combinatorial types and diameter bounds
Cut problems on graphs
Linear extension graphs and linear extension diameter
Combinatorial Algorithms for Graph Sparsification
Random graphs and combinatorial structures :
Random graphs and combinatorial structures :
Approximating Perpetuities
Geometric and combinatorial structures on graphs
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating distributed graph algorithms
Hanani-Tutte for approximating maps of graphs
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Polytopes with few coordinate values : combinatorial types and diameter bounds
Cut problems on graphs
Linear extension graphs and linear extension diameter
Combinatorial Algorithms for Graph Sparsification
Random graphs and combinatorial structures :
Random graphs and combinatorial structures :
Approximating Perpetuities
Geometric and combinatorial structures on graphs
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating distributed graph algorithms
Hanani-Tutte for approximating maps of graphs
From worst-case to average-case efficiency : approximating combinatorial optimization problems
Polytopes with few coordinate values : combinatorial types and diameter bounds
Cut problems on graphs
Linear extension graphs and linear extension diameter
Combinatorial Algorithms for Graph Sparsification
Random graphs and combinatorial structures :
Random graphs and combinatorial structures :
Approximating Perpetuities
Geometric and combinatorial structures on graphs