1.375-Approximation Algorithm for Sorting by Reversals (Englisch)
- Neue Suche nach: Berman, P.
- Neue Suche nach: Hannenhalli, S.
- Neue Suche nach: Karpinski, M.
- Neue Suche nach: Berman, P.
- Neue Suche nach: Hannenhalli, S.
- Neue Suche nach: Karpinski, M.
- Neue Suche nach: Mohring, R. H.
- Neue Suche nach: Raman, R.
In:
Algorithms; Algorithms--ESA 2002
;
200-210
;
2002
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Print
-
Titel:1.375-Approximation Algorithm for Sorting by Reversals
-
Beteiligte:Berman, P. ( Autor:in ) / Hannenhalli, S. ( Autor:in ) / Karpinski, M. ( Autor:in ) / Mohring, R. H. / Raman, R.
-
Kongress:Annual European symposium; 10th, Algorithms; Algorithms--ESA 2002 ; 2002 ; Rome
-
Erschienen in:Algorithms; Algorithms--ESA 2002 ; 200-210LECTURE NOTES IN COMPUTER SCIENCE ; 200-210
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:New York
-
Erscheinungsdatum:01.01.2002
-
Format / Umfang:11 pages
-
ISBN:
-
ISSN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis Konferenzband
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.
- 5
-
Kinetic Medians and kd-TreesAgarwal, P. K. / Gao, J. / Guibas, L. J. et al. | 2002
- 17
-
Range Searching in Categorical Data: Colored Range Searching on GridAgarwal, P. K. / Govindarajan, S. / Muthukrishnan, S. et al. | 2002
- 29
-
Near-Linear Time Approximation Algorithms for Curve SimplificationAgarwal, P. K. / Har-Peled, S. / Mustafa, N. H. / Wang, Y. et al. | 2002
- 42
-
Translating a Planar Object to Maximize Point ContainmentAgarwal, P. K. / Hagerup, T. / Ray, R. / Sharir, M. / Smid, M. / Welzl, E. et al. | 2002
- 54
-
Approximation Algorithms for k-Line CenterAgarwal, P. K. / Procopiuc, C. M. / Varadarajan, K. R. et al. | 2002
- 64
-
New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman ProblemAhr, D. / Reinelt, G. et al. | 2002
- 75
-
SCIL - Symbolic Constraints in Integer Linear ProgrammingAlthaus, E. / Bockmayr, A. / Elf, M. / Junger, M. / Kasper, T. / Mehlhorn, K. et al. | 2002
- 88
-
Implementing I/O-efficient Data Structures Using TPIEArge, L. / Procopiuc, O. / Vitter, J. S. et al. | 2002
- 101
-
On the k-Splittable Flow ProblemBaier, G. / Kohler, E. / Skutella, M. et al. | 2002
- 114
-
Partial Alphabetic TreesBarkan, A. / Kaplan, H. et al. | 2002
- 126
-
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS RouterBarrett, C. / Bisset, K. / Jacob, R. / Konjevod, G. / Marathe, M. et al. | 2002
- 139
-
Scanning and Traversing: Maintaining Data for Traversals in a Memory HierarchyBender, M. A. / Cole, R. / Demaine, E. D. / Farach-Colton, M. et al. | 2002
- 152
-
Two Simplified Algorithms for Maintaining Order in a ListBender, M. A. / Cole, R. / Demaine, E. D. / Farach-Colton, M. / Zito, J. et al. | 2002
- 165
-
Efficient Tree Layout in a Multilevel Memory HierarchyBender, M. A. / Demaine, E. D. / Farach-Colton, M. et al. | 2002
- 174
-
A Computational Basis for Conic Arcs and Boolean Operations on Conic PolygonsBerberich, E. / Eigenwillig, A. / Hemmer, M. / Hert, S. / Mehlhorn, K. / Schomer, E. et al. | 2002
- 187
-
TSP with Neighborhoods of Varying Sizede Berg, M. / Gudmundsson, J. / Katz, M. J. / Levcopoulos, C. / Overmars, M. H. / van der Stappen, A. F. et al. | 2002
- 200
-
1.375-Approximation Algorithm for Sorting by ReversalsBerman, P. / Hannenhalli, S. / Karpinski, M. et al. | 2002
- 211
-
Radio Labeling with Pre-assigned FrequenciesBodlaender, H. L. / Broersma, H. / Fomin, F. V. / Pyatkin, A. V. / Woeginger, G. J. et al. | 2002
- 223
-
Branch-and-Bound Algorithms for the Test Cover ProblemDe Bontridder, K. M. J. / Lageweg, B. J. / Lenstra, J. K. / Orlin, J. B. / Stougie, L. et al. | 2002
- 234
-
Constructing Plane Spanners of Bounded Degree and Low WeightBose, P. / Gudmundsson, J. / Smid, M. et al. | 2002
- 247
-
Eager st-OrderingBrandes, U. et al. | 2002
- 257
-
Three-Dimensional Layers of MaximaBuchsbaum, A. L. / Goodrich, M. T. et al. | 2002
- 270
-
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation TherapyChen, D. Z. / Hu, X. S. / Luan, S. / Wu, X. / Yu, C. X. et al. | 2002
- 284
-
Geometric Algorithms for Density-Based Data ClusteringChen, D. Z. / Smid, M. / Xu, B. et al. | 2002
- 297
-
Balanced-Replication Algorithms for Distribution TreesCohen, E. / Kaplan, H. et al. | 2002
- 310
-
Butterflies and Peer-to-Peer NetworksDatar, M. et al. | 2002
- 323
-
Estimating Rarity and Similarity over Data Stream WindowsDatar, M. / Muthukrishnan, S. et al. | 2002
- 335
-
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access ChannelsDe Bonis, A. / Vaccaro, U. et al. | 2002
- 348
-
Frequency Estimation of Internet Packet Streams with Limited SpaceDemaine, E. D. / Lopez-Ortiz, A. / Munro, J. I. et al. | 2002
- 361
-
Truthful and Competitive Double AuctionsDeshmukh, K. / Goldberg, A. V. / Hartline, J. D. / Karlin, A. R. et al. | 2002
- 374
-
Optimal Graph Exploration without Good MapsDessmark, A. / Pelc, A. et al. | 2002
- 387
-
Approximating the Medial Axis from the Voronoi Diagram with a Convergence GuaranteeDey, T. K. / Zhao, W. et al. | 2002
- 399
-
Non-independent Randomized Rounding and an Application to Digital HalftoningDoerr, B. / Schnieder, H. et al. | 2002
- 411
-
Computing Homotopic Shortest Paths EfficientlyEfrat, A. / Kobourov, S. G. / Lubiw, A. et al. | 2002
- 424
-
An Algorithm for Dualization in Products of Lattices and Its ApplicationsElbassioni, K. M. et al. | 2002
- 436
-
Determining Similarity of Conformational PolymorphsEnosh, A. / Kedem, K. / Bernstein, J. et al. | 2002
- 449
-
Minimizing the Maximum Starting Time On-lineEpstein, L. / van Stee, R. et al. | 2002
- 461
-
Vector Assignment Problems: A General FrameworkEpstein, L. / Tassa, T. et al. | 2002
- 473
-
Speeding Up the Incremental Construction of the Union of Geometric Objects in PracticeEzra, E. / Halperin, D. / Sharir, M. et al. | 2002
- 485
-
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum CliqueFahle, T. et al. | 2002
- 499
-
Online Companion CachingFiat, A. / Mendel, M. / Seiden, S. S. et al. | 2002
- 512
-
Deterministic Communication in Radio Networks with Large LabelsGasieniec, L. / Pagourtzis, A. / Potapov, I. et al. | 2002
- 525
-
A Primal Approach to the Stable Set ProblemGentile, C. / Haus, U.-U. / Koppe, M. / Rinaldi, G. / Weismantel, R. et al. | 2002
- 538
-
Wide-Sense Nonblocking WDM Cross-ConnectsHaxell, P. / Rasala, A. / Wilfong, G. / Winkler, P. et al. | 2002
- 550
-
Efficient Implementation of a Minimal Triangulation AlgorithmHeggernes, P. / Villanger, Y. et al. | 2002
- 562
-
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation SchemeJansen, K. et al. | 2002
- 574
-
The Probabilistic Analysis of a Greedy Satisfiability AlgorithmKaporis, A. C. / Kirousis, L. M. / Lalas, E. G. et al. | 2002
- 586
-
Dynamic Additively Weighted Voronoi Diagrams in 2DKaravelas, M. I. / Yvinec, M. et al. | 2002
- 599
-
Time-Expanded Graphs for Flow-Dependent Transit TimesKohler, E. / Langkau, K. / Skutella, M. et al. | 2002
- 612
-
Partially-Ordered Knapsack and Applications to SchedulingKolliopoulos, S. G. / Steiner, G. et al. | 2002
- 625
-
A Software Library for Elliptic Curve CryptographyKonstantinou, E. / Stamatiou, Y. / Zaroliagis, C. et al. | 2002
- 637
-
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time WindowsKrumke, S. O. / Rambau, J. / Torres, L. M. et al. | 2002
- 649
-
Randomized Approximation Algorithms for Query Optimization Problems on Two ProcessorsLaber, E. / Parekh, O. / Ravi, R. et al. | 2002
- 662
-
Covering Things with ThingsLangerman, S. / Morin, P. et al. | 2002
- 674
-
On-Line Dial-a-Ride Problems under a Restricted Information ModelLipmann, M. / Lu, X. / de Paepe, W. E. / Sitters, R. A. / Stougie, L. et al. | 2002
- 686
-
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic GraphsLorys, K. / Zwozniak, G. et al. | 2002
- 698
-
Engineering a Lightweight Suffix Array Construction AlgorithmManzini, G. / Ferragina, P. et al. | 2002
- 711
-
Complexity of Compatible Decompositions of Eulerian Graphs and Their TransformationsMaxova, J. / Nesetril, J. et al. | 2002
- 723
-
External-Memory Breadth-First Search with Sublinear I/OMehlhorn, K. / Meyer, U. et al. | 2002
- 736
-
Frequency Channel Assignment on Planar NetworksMolloy, M. / Salavatipour, M. R. et al. | 2002
- 748
-
Design and Implementation of Efficient Data Types for Static GraphsNaher, S. / Zlotowski, O. et al. | 2002
- 760
-
An Exact Algorithm for the Uniformly-Oriented Steiner Tree ProblemNielsen, B. K. / Winter, P. / Zachariasen, M. et al. | 2002
- 772
-
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian OptionsOhta, K. / Sadakane, K. / Shioura, A. / Tokuyama, T. et al. | 2002
- 785
-
Sorting 13 Elements Requires 34 ComparisonsPeczarski, M. et al. | 2002
- 795
-
Extending Reduction Techniques for the Steiner Tree ProblemPolzin, T. / Daneshmand, S. V. et al. | 2002
- 808
-
A Comparison of Multicast Pull ModelsPruhs, K. / Uthaisombut, P. et al. | 2002
- 820
-
Online Scheduling for Sorting BuffersRacke, H. / Sohler, C. / Westermann, M. et al. | 2002
- 833
-
Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented CubesSchurr, I. / Szabo, T. et al. | 2002
- 845
-
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network DesignSellmann, M. / Kliewer, G. / Koberstein, A. et al. | 2002
- 859
-
Minimizing Makespan and Preemption Costs on a System of Uniform MachinesShachnai, H. / Tamir, T. / Woeginger, G. J. et al. | 2002
- 872
-
Minimizing the Total Completion Time On-line on a Single Machine, Using Restartsvan Stee, R. / La Poutre, H. et al. | 2002
- 884
-
High-Level Filtering for Arrangements of Conic ArcsWein, R. et al. | 2002
- 896
-
An Approximation Scheme for Cake Division with a Linear Number of CutsWoeginger, G. J. et al. | 2002
- 902
-
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane GraphsZhang, H. / He, X. et al. | 2002