A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity (Englisch)
- Neue Suche nach: Gubbala, Prabhakar
- Neue Suche nach: Raghavachari, Balaji
- Neue Suche nach: Gubbala, Prabhakar
- Neue Suche nach: Raghavachari, Balaji
In:
Algorithms and Data Structures
3
;
39-51
;
2007
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
-
Beteiligte:Gubbala, Prabhakar ( Autor:in ) / Raghavachari, Balaji ( Autor:in )
-
Erschienen in:Algorithms and Data Structures , 3 ; 39-51Lecture Notes in Computer Science ; 4619, 3 ; 39-51
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.2007
-
Format / Umfang:13 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
-
Finding Small HolesErickson, Jeff et al. | 2007
- 2
-
Approximate Range Searching: The Absolute ModelFonseca, Guilherme D. et al. | 2007
- 15
-
Orthogonal Range Searching in Linear and Almost-Linear SpaceNekrich, Yakov et al. | 2007
- 27
-
Spherical LSH for Approximate Nearest Neighbor Search on Unit HypersphereTerasawa, Kengo / Tanaka, Yuzuru et al. | 2007
- 39
-
A 4/3-Approximation Algorithm for Minimum 3-Edge-ConnectivityGubbala, Prabhakar / Raghavachari, Balaji et al. | 2007
- 52
-
Approximating the Maximum Sharing ProblemChaudhary, Amitabh / Chen, Danny Z. / Fleischer, Rudolf / Hu, Xiaobo S. / Li, Jian / Niemier, Michael T. / Xie, Zhiyi / Zhu, Hong et al. | 2007
- 64
-
The Stackelberg Minimum Spanning Tree GameCardinal, Jean / Demaine, Erik D. / Fiorini, Samuel / Joret, Gwenaël / Langerman, Stefan / Newman, Ilan / Weimann, Oren et al. | 2007
- 77
-
Edges and Switches, Tunnels and BridgesEppstein, David / Kreveld, Marc / Mumford, Elena / Speckmann, Bettina et al. | 2007
- 89
-
How to Draw a Clustered TreeBattista, Giuseppe / Drovandi, Guido / Frati, Fabrizio et al. | 2007
- 102
-
Drawing Colored Graphs on Colored PointsBadent, Melanie / Giacomo, Emilio / Liotta, Giuseppe et al. | 2007
- 114
-
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski MetricAtallah, Mikhail J. / Blanton, Marina / Goodrich, Michael T. / Polu, Stanislas et al. | 2007
- 127
-
Priority Queues Resilient to Memory FaultsJørgensen, Allan Grønlund / Moruz, Gabriel / Mølhave, Thomas et al. | 2007
- 139
-
Simple and Space-Efficient Minimal Perfect Hash FunctionsBotelho, Fabiano C. / Pagh, Rasmus / Ziviani, Nivio et al. | 2007
- 151
-
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the PlaneMüller-Hannemann, Matthias / Tazari, Siamak et al. | 2007
- 163
-
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery ProblemsDeshpande, Ajay / Kim, Taejung / Demaine, Erik D. / Sarma, Sanjay E. et al. | 2007
- 175
-
Optimization for First Order Delaunay TriangulationsKreveld, Marc / Löffler, Maarten / Silveira, Rodrigo I. et al. | 2007
- 188
-
Constant Factor Approximations for the Hotlink Assignment ProblemJacobs, Tobias et al. | 2007
- 201
-
Approximation Algorithms for the Sex-Equal Stable Marriage ProblemIwama, Kazuo / Miyazaki, Shuichi / Yanagisawa, Hiroki et al. | 2007
- 214
-
A Stab at Approximating Minimum Subadditive JoinVinterbo, Staal A. et al. | 2007
- 226
-
Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two DatasetsLangston, Michael A. et al. | 2007
- 227
-
Flooding Countries and Destroying DamsSilveira, Rodrigo I. / Oostrum, René et al. | 2007
- 239
-
I/O-Efficient Flow Modeling on Fat TerrainsBerg, Mark / Cheong, Otfried / Haverkort, Herman / Lim, Jung Gun / Toma, Laura et al. | 2007
- 251
-
Computing the Visibility Map of Fat ObjectsBerg, Mark / Gray, Chris et al. | 2007
- 263
-
Independent Sets in Bounded-Degree HypergraphsHalldórsson, Magnús M. / Losievskaja, Elena et al. | 2007
- 275
-
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on EpsilonBorradaile, Glencora / Klein, Philip N. / Mathieu, Claire et al. | 2007
- 287
-
Computing a Minimum-Depth Planar Graph Embedding in O(n 4) TimeAngelini, Patrizio / Battista, Giuseppe / Patrignani, Maurizio et al. | 2007
- 300
-
On a Family of Strong Geometric Spanners That Admit Local Routing StrategiesBose, Prosenjit / Carmi, Paz / Couture, Mathieu / Smid, Michiel / Xu, Daming et al. | 2007
- 312
-
Spanners for Geometric Intersection GraphsFürer, Martin / Kasiviswanathan, Shiva Prasad et al. | 2007
- 325
-
On Generalized Diamond SpannersBose, Prosenjit / Lee, Aaron / Smid, Michiel et al. | 2007
- 337
-
The k-Resource Problem on Uniform and on Uniformly Decomposable Metric SpacesBienkowski, Marcin / Kutyłowski, Jarosław et al. | 2007
- 349
-
On the Robustness of Graham’s Algorithm for Online SchedulingGatto, Michael / Widmayer, Peter et al. | 2007
- 362
-
Improved Results for a Memory Allocation ProblemEpstein, Leah / Stee, Rob et al. | 2007
- 374
-
Computational and Structural Advantages of Circular Boundary RepresentationAichholzer, Oswin / Aurenhammer, Franz / Hackl, Thomas / Jüttler, Bert / Oberneder, Margot / Šír, Zbyněk et al. | 2007
- 386
-
Alpha-Beta Witness ComplexesAttali, Dominique / Edelsbrunner, Herbert / Harer, John / Mileyko, Yuriy et al. | 2007
- 398
-
Cauchy’s Theorem and Edge Lengths of Convex PolyhedraBiedl, Therese / Lubiw, Anna / Spriggs, Michael et al. | 2007
- 410
-
Fixed-Parameter Tractability for Non-Crossing Spanning TreesHalldórsson, Magnús M. / Knauer, Christian / Spillner, Andreas / Tokuyama, Takeshi et al. | 2007
- 422
-
Improved Algorithms for the Feedback Vertex Set ProblemsChen, Jianer / Fomin, Fedor V. / Liu, Yang / Lu, Songjian / Villanger, Yngve et al. | 2007
- 434
-
Kernelization Algorithms for d-Hitting Set ProblemsAbu-Khzam, Faisal N. et al. | 2007
- 446
-
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise PointsLöffler, Maarten / Kreveld, Marc et al. | 2007
- 458
-
Maximizing Maximal Angles for Plane Straight-Line GraphsAichholzer, Oswin / Hackl, Thomas / Hoffmann, Michael / Huemer, Clemens / Pór, Attila / Santos, Francisco / Speckmann, Bettina / Vogtenhuber, Birgit et al. | 2007
- 470
-
Cuttings for Disks and Axis-Aligned RectanglesRafalin, Eynat / Souvaine, Diane L. / Tóth, Csaba D. et al. | 2007
- 483
-
Kernelization and Complexity Results for Connectivity Augmentation ProblemsGuo, Jiong / Uhlmann, Johannes et al. | 2007
- 495
-
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut ProblemChen, Jianer / Liu, Yang / Lu, Songjian et al. | 2007
- 507
-
Branch and Recharge: Exact Algorithms for Generalized DominationFomin, Fedor V. / Golovach, Petr A. / Kratochvíl, Jan / Kratsch, Dieter / Liedloff, Mathieu et al. | 2007
- 519
-
On Computing the Centroid of the Vertices of an Arrangement and Related ProblemsAjwani, Deepak / Ray, Saurabh / Seidel, Raimund / Tiwary, Hans Raj et al. | 2007
- 529
-
Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small pBhattacharya, Binay / Shi, Qiaosheng et al. | 2007
- 541
-
Faster Approximation of Distances in GraphsBerman, Piotr / Kasiviswanathan, Shiva Prasad et al. | 2007
- 553
-
Approximate Shortest Paths Guided by a Small IndexDerungs, Jörg / Jacob, Riko / Widmayer, Peter et al. | 2007
- 565
-
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor ModelFarach-Colton, Martín / Mosteiro, Miguel A. et al. | 2007
- 577
-
Computing Best Coverage Path in the Presence of Obstacles in a Sensor FieldRoy, Senjuti Basu / Das, Gautam / Das, Sajal et al. | 2007
- 589
-
35/44-Approximation for Asymmetric Maximum TSP with Triangle InequalityKowalik, Łukasz / Mucha, Marcin et al. | 2007
- 601
-
On Euclidean Vehicle Routing with AllocationRemy, Jan / Spöhel, Reto / Weißl, Andreas et al. | 2007
- 613
-
Optimal Lightweight Construction of Suffix Arrays for Constant AlphabetsNong, Ge / Zhang, Sen et al. | 2007
- 625
-
Range Non-overlapping Indexing and Successive List IndexingKeller, Orgad / Kopelowitz, Tsvi / Lewenstein, Moshe et al. | 2007
- 637
-
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom FiltersEppstein, David / Goodrich, Michael T. et al. | 2007
- 649
-
Dynamic TCP Acknowledgment with Sliding WindowKoga, Hisashi et al. | 2007