Additive Spanners: A Simple Construction (Englisch)
- Neue Suche nach: Knudsen, Mathias Bæk Tejs
- Neue Suche nach: Knudsen, Mathias Bæk Tejs
In:
Algorithm Theory – SWAT 2014
;
277-281
;
2014
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Additive Spanners: A Simple Construction
-
Beteiligte:Knudsen, Mathias Bæk Tejs ( Autor:in )
-
Erschienen in:Algorithm Theory – SWAT 2014 ; 277-281Lecture Notes in Computer Science ; 8503 ; 277-281
-
Verlag:
- Neue Suche nach: Springer International Publishing
-
Erscheinungsort:Cham
-
Erscheinungsdatum:01.01.2014
-
Format / Umfang:5 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
I/O-Efficient Range Minima QueriesAfshani, Peyman / Sitchinava, Nodari et al. | 2014
- 13
-
Online Makespan Minimization with Parallel SchedulesAlbers, Susanne / Hellwig, Matthias et al. | 2014
- 26
-
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)Belazzougui, Djamal / Brodal, Gerth Stølting / Nielsen, Jesper Sindahl et al. | 2014
- 38
-
Amortized Analysis of Smooth Quadtrees in All DimensionsBennett, Huck / Yap, Chee et al. | 2014
- 50
-
New Approximability Results for the Robust k-Median ProblemBhattacharya, Sayan / Chalermsook, Parinya / Mehlhorn, Kurt / Neumann, Adrian et al. | 2014
- 62
-
Trees and Co-trees with Bounded Degrees in Planar 3-connected GraphsBiedl, Therese et al. | 2014
- 74
-
Approximating the Revenue Maximization Problem with Sharp DemandsBilò, Vittorio / Flammini, Michele / Monaco, Gianpiero et al. | 2014
- 86
-
Reconfiguring Independent Sets in Claw-Free GraphsBonsma, Paul / Kamiński, Marcin / Wrochna, Marcin et al. | 2014
- 98
-
Competitive Online Routing on Delaunay TriangulationsBose, Prosenjit / Carufel, Jean-Lou / Durocher, Stephane / Taslakian, Perouz et al. | 2014
- 110
-
Optimal Planar Orthogonal Skyline Counting QueriesBrodal, Gerth Stølting / Larsen, Kasper Green et al. | 2014
- 122
-
B-slack Trees: Space Efficient B-TreesBrown, Trevor et al. | 2014
- 134
-
Approximately Minwise Independence with Twisted TabulationDahlgaard, Søren / Thorup, Mikkel et al. | 2014
- 146
-
Separability of Imprecise PointsBerg, Mark / Mehrabi, Ali D. / Sheikhi, Farnaz et al. | 2014
- 158
-
Line-Distortion, Bandwidth and Path-Length of a GraphDragan, Feodor F. / Köhler, Ekkehard / Leitert, Arne et al. | 2014
- 170
-
Colorful Bin PackingDósa, György / Epstein, Leah et al. | 2014
- 182
-
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal CliquesFomin, Fedor V. / Liedloff, Mathieu / Montealegre, Pedro / Todinca, Ioan et al. | 2014
- 194
-
Win-Win Kernelization for Degree Sequence Completion ProblemsFroese, Vincent / Nichterlein, André / Niedermeier, Rolf et al. | 2014
- 206
-
On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set ProblemFujito, Toshihiro et al. | 2014
- 217
-
Covering Problems in Edge- and Node-Weighted GraphsFukunaga, Takuro et al. | 2014
- 229
-
Colored Range Searching in Linear SpaceGrossi, Roberto / Vind, Søren et al. | 2014
- 241
-
Fast Dynamic Graph Algorithms for Parameterized ProblemsIwata, Yoichi / Oka, Keigo et al. | 2014
- 253
-
Extending Partial Representations of Proper and Unit Interval GraphsKlavík, Pavel / Kratochvíl, Jan / Otachi, Yota / Rutter, Ignaz / Saitoh, Toshiki / Saumell, Maria / Vyskočil, Tomáš et al. | 2014
- 265
-
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler DiagramsKlemz, Boris / Mchedlidze, Tamara / Nöllenburg, Martin et al. | 2014
- 277
-
Additive Spanners: A Simple ConstructionKnudsen, Mathias Bæk Tejs et al. | 2014
- 282
-
Assigning Channels via the Meet-in-the-Middle ApproachKowalik, Łukasz / Socała, Arkadiusz et al. | 2014
- 294
-
Consistent Subset SamplingKutzkov, Konstantin / Pagh, Rasmus et al. | 2014
- 306
-
Triangle Counting in Dynamic Graph StreamsKutzkov, Konstantin / Pagh, Rasmus et al. | 2014
- 319
-
Linear Time LexDFS on Cocomparability Graphs.Köhler, Ekkehard / Mouatadid, Lalla et al. | 2014
- 331
-
Quantum Algorithms for Matrix Products over SemiringsGall, François / Nishimura, Harumichi et al. | 2014
- 344
-
Ranked Document SelectionMunro, J. Ian / Navarro, Gonzalo / Shah, Rahul / Thankachan, Sharma V. et al. | 2014
- 357
-
Approximation Algorithms for Hitting Triangle-Free Sets of Line SegmentsJoshi, Anup / Narayanaswamy, N. S. et al. | 2014
- 368
-
Reduction Techniques for Graph Isomorphism in the Context of Width ParametersOtachi, Yota / Schweitzer, Pascal et al. | 2014
- 380
-
Approximate Counting of Matchings in (3,3)-HypergraphsDudek, Andrzej / Karpinski, Marek / Ruciński, Andrzej / Szymańska, Edyta et al. | 2014