↓ Skip to main content

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 LIAR!
  3. Altmetric Badge
    Chapter 2 Experiments for Algorithm Engineering
  4. Altmetric Badge
    Chapter 3 Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
  5. Altmetric Badge
    Chapter 4 Cylindrical Hierarchy for Deforming Necklaces
  6. Altmetric Badge
    Chapter 5 Geometric Algorithms for Agglomerative Hierarchical Clustering
  7. Altmetric Badge
    Chapter 6 Traveling Salesman Problem of Segments
  8. Altmetric Badge
    Chapter 7 Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs
  9. Altmetric Badge
    Chapter 8 A Space Efficient Algorithm for Sequence Alignment with Inversions
  10. Altmetric Badge
    Chapter 9 On the Similarity of Sets of Permutations and Its Applications to Genome Comparison
  11. Altmetric Badge
    Chapter 10 On All-Substrings Alignment Problems
  12. Altmetric Badge
    Chapter 11 The Specker-Blatter Theorem Revisited
  13. Altmetric Badge
    Chapter 12 On the Divergence Bounded Computable Real Numbers
  14. Altmetric Badge
    Chapter 13 Sparse Parity-Check Matrices over Finite Fields
  15. Altmetric Badge
    Chapter 14 On the Full and Bottleneck Full Steiner Tree Problems
  16. Altmetric Badge
    Chapter 15 The Structure and Number of Global Roundings of a Graph
  17. Altmetric Badge
    Chapter 16 On Even Triangulations of 2-Connected Embedded Graphs
  18. Altmetric Badge
    Chapter 17 Petri Nets with Simple Circuits
  19. Altmetric Badge
    Chapter 18 Automatic Verification of Multi-queue Discrete Timed Automata
  20. Altmetric Badge
    Chapter 19 List Total Colorings of Series-Parallel Graphs
  21. Altmetric Badge
    Chapter 20 Finding Hidden Independent Sets in Interval Graphs
  22. Altmetric Badge
    Chapter 21 Matroid Representation of Clique Complexes
  23. Altmetric Badge
    Chapter 22 On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results
  24. Altmetric Badge
    Chapter 23 The Complexity of Boolean Matrix Root Computation
  25. Altmetric Badge
    Chapter 24 A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions
  26. Altmetric Badge
    Chapter 25 Group Mutual Exclusion Algorithms Based on Ticket Orders
  27. Altmetric Badge
    Chapter 26 Distributed Algorithm for Better Approximation of the Maximum Matching
  28. Altmetric Badge
    Chapter 27 Efficient Mappings for Parity-Declustered Data Layouts
  29. Altmetric Badge
    Chapter 28 Approximate Rank Aggregation
  30. Altmetric Badge
    Chapter 29 Perturbation of the Hyper-Linked Environment
  31. Altmetric Badge
    Chapter 30 Fast Construction of Generalized Suffix Trees over a Very Large Alphabet
  32. Altmetric Badge
    Chapter 31 Complexity Theoretic Aspects of Some Cryptographic Functions
  33. Altmetric Badge
    Chapter 32 Quantum Sampling for Balanced Allocations
  34. Altmetric Badge
    Chapter 33 Fault-Hamiltonicity of Product Graph of Path and Cycle
  35. Altmetric Badge
    Chapter 34 How to Obtain the Complete List of Caterpillars
  36. Altmetric Badge
    Chapter 35 Randomized Approximation of the Stable Marriage Problem
  37. Altmetric Badge
    Chapter 36 Tetris is Hard, Even to Approximate
  38. Altmetric Badge
    Chapter 37 Approximate MST for UDG Locally
  39. Altmetric Badge
    Chapter 38 Efficient Construction of Low Weight Bounded Degree Planar Spanner
  40. Altmetric Badge
    Chapter 39 Isoperimetric Inequalities and the Width Parameters of Graphs
  41. Altmetric Badge
    Chapter 40 Graph Coloring and the Immersion Order
  42. Altmetric Badge
    Chapter 41 Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
  43. Altmetric Badge
    Chapter 42 Scheduling Broadcasts with Deadlines
  44. Altmetric Badge
    Chapter 43 Improved Competitive Algorithms for Online Scheduling with Partial Job Values
  45. Altmetric Badge
    Chapter 44 Majority Equilibrium for Public Facility Allocation
  46. Altmetric Badge
    Chapter 45 On Constrained Minimum Pseudotriangulations
  47. Altmetric Badge
    Chapter 46 Pairwise Data Clustering and Applications
  48. Altmetric Badge
    Chapter 47 Covering a Set of Points with a Minimum Number of Turns
  49. Altmetric Badge
    Chapter 48 Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees
  50. Altmetric Badge
    Chapter 49 Bounds for Convex Crossing Numbers
  51. Altmetric Badge
    Chapter 50 On Spectral Graph Drawing
  52. Altmetric Badge
    Chapter 51 On a Conjecture on Wiener Indices in Combinatorial Chemistry
  53. Altmetric Badge
    Chapter 52 Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data
  54. Altmetric Badge
    Chapter 53 Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences
  55. Altmetric Badge
    Chapter 54 Genomic Distances under Deletions and Insertions
  56. Altmetric Badge
    Chapter 55 Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
Attention for Chapter 6: Traveling Salesman Problem of Segments
Altmetric Badge

Citations

dimensions_citation
1 Dimensions
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Traveling Salesman Problem of Segments
Chapter number 6
Book title
Computing and Combinatorics
Published by
Springer, Berlin, Heidelberg, July 2003
DOI 10.1007/3-540-45071-8_6
Book ISBNs
978-3-54-040534-4, 978-3-54-045071-9
Authors

Jinhui Xu, Yang Yang, Zhiyong Lin, Xu, Jinhui, Yang, Yang, Lin, Zhiyong