Noncrossing subgraphs in topological layouts
SIAM Journal on Discrete Mathematics
Reconstructing sets of orthogonal line segments in the plane
Discrete Mathematics
Configurations with few crossings in topological graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Algorithms for graphs embeddable with few crossings per edge
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Parameterized Complexity
Fixed-parameter tractability for non-crossing spanning trees
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
In this paper we study the problem of computing subgraphs of a certain configuration in a given topological graph G such that the number of crossings in the subgraph is minimum. The configurations that we consider are spanning trees, s-t paths, cycles, matchings, and @k-factors for @k@?{1,2}. We show that it is NP-hard to approximate the minimum number of crossings for these configurations within a factor of k^1^-^@e for any @e0, where k is the number of crossings in G. We then give a simple fixed-parameter algorithm that tests in O^@?(2^k) time whether G has a crossing-free configuration for any of the above, where the O^@?-notation neglects polynomial terms. For some configurations we have faster algorithms. The respective running times are O^@?(1.9999992^k) for spanning trees and O^@?((3)^k) for s-t paths and cycles. For spanning trees we also have an O^@?(1.968^k)-time Monte-Carlo algorithm. Each O^@?(@b^k)-time decision algorithm can be turned into an O^@?((@b+1)^k)-time optimization algorithm that computes a configuration with the minimum number of crossings.