Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Algorithmica

Search In Journal Title:

Abbravation: Algorithmica

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

The Parameterized Complexity of Local Search for T

Authors: Jiong Guo Sepp Hartung Rolf Niedermeier Ondřej Suchý
Publish Date: 2012/09/08
Volume: 67, Issue: 1, Pages: 89-110
PDF Link

Abstract

We extend previous work on the parameterized complexity of local search for the Traveling Salesperson Problem TSP So far its parameterized complexity has been investigated with respect to the distance measures defining the local search area “Edge Exchange” and “MaxShift” We perform studies with respect to the distance measures “Swap” and “rSwap” “Reversal” and “rReversal” and “Edit” achieving both fixedparameter tractability and W1hardness results In particular from the parameterized reduction showing W1hardness we infer running time lower bounds based on the exponential time hypothesis for all corresponding distance measures Moreover we provide nonexistence results for polynomialsize problem kernels and we show that some in general W1hard problems turn fixedparameter tractable when restricted to planar graphsAn extended abstract of this paper appeared in Proceedings of the 22nd International Symposium on Algorithms and Computation ISAAC’11 Yokohama Japan Dec 2011 volume 7074 of LNCS pages 614–623 Springer 2011 An important difference compared to the conference version is that we significantly improved the running time lower bounds

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. On Minimum Sum of Radii and Diameters Clustering
  2. Integer Representation and Counting in the Bit Probe Model
  3. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
  4. New Approximation Algorithms for Minimum Cycle Bases of Graphs
  5. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
  6. Aligning Two Convex Figures to Minimize Area or Perimeter
  7. Introduction for S.I. AofA14
  8. Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  9. Detecting Regular Visit Patterns
  10. Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
  11. Random Matrices and Codes for the Erasure Channel
  12. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
  13. The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  14. Optimal Parallel Quantum Query Algorithms
  15. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges
  16. Maximum Series-Parallel Subgraph
  17. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
  18. Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
  19. Approximating Fixation Probabilities in the Generalized Moran Process
  20. Approximation Algorithms for Scheduling with Reservations
  21. Algorithms for the Homogeneous Set Sandwich Problem
  22. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  23. Computing Minimum Cuts by Randomized Search Heuristics
  24. Constructing Labeling Schemes through Universal Matrices
  25. An Approximation Algorithm for the Minimum Co-Path Set Problem
  26. Scheduling with an Orthogonal Resource Constraint
  27. Approximate Boyer-Moore String Matching for Small Alphabets
  28. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  29. Between Treewidth and Clique-Width
  30. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  31. Multi-sided Boundary Labeling
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: