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:

DOI

10.1016/0002-9378(59)90261-3

Search In DOI:

ISSN

1432-0541

Search In ISSN:
Search In Title Of Papers:

Multisided Boundary Labeling

Authors: Philipp Kindermann Benjamin Niedermann Ignaz Rutter Marcus Schaefer André Schulz Alexander Wolff
Publish Date: 2015/07/21
Volume: 76, Issue: 1, Pages: 225-258
PDF Link

Abstract

In the Boundary Labeling problem we are given a set of n points referred to as sites inside an axisparallel rectangle R and a set of n pairwise disjoint rectangular labels that are attached to R from the outside The task is to connect the sites to the labels by nonintersecting rectilinear paths socalled leaders with at most one bend In this paper we study the MultiSided Boundary Labeling problem with labels lying on at least two sides of the enclosing rectangle We present a polynomialtime algorithm that computes a crossingfree leader layout if one exists So far such an algorithm has only been known for the cases in which labels lie on one side or on two opposite sides of R here a crossingfree solution always exists The case where labels may lie on adjacent sides is more difficult We present efficient algorithms for testing the existence of a crossingfree leader layout that labels all sites and also for maximizing the number of labeled sites in a crossingfree leader layout For twosided boundary labeling with adjacent sides we further show how to minimize the total leader length in a crossingfree layoutA preliminary version of this paper has appeared in Proc 13th Int Algorithms Data Struct Symp WADS’13 volume 8037 of Lect Notes Comput Sci pages 463–474 SpringerVerlag This research was initiated during the GraDr Midterm meeting at the TU Berlin in October 2012 The meeting was supported by the ESF EuroGIGA networking grant Ph Kindermann acknowledges support by the ESF EuroGIGA project GraDR DFG Grant Wo 758/51

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. The Parameterized Complexity of Local Search for TSP, More Refined
  20. Approximating Fixation Probabilities in the Generalized Moran Process
  21. Approximation Algorithms for Scheduling with Reservations
  22. Algorithms for the Homogeneous Set Sandwich Problem
  23. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
  24. Computing Minimum Cuts by Randomized Search Heuristics
  25. Constructing Labeling Schemes through Universal Matrices
  26. An Approximation Algorithm for the Minimum Co-Path Set Problem
  27. Scheduling with an Orthogonal Resource Constraint
  28. Approximate Boyer-Moore String Matching for Small Alphabets
  29. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
  30. Between Treewidth and Clique-Width
  31. What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid
  32. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Search Result: