The Problem of Compatible Representatives
From MaRDI portal
Publication:4018853
DOI10.1137/0405033zbMath0825.68494arXivcs/9301116OpenAlexW2121601978WikidataQ106465577 ScholiaQ106465577MaRDI QIDQ4018853
Arvind U. Raghunathan, Donald E. Knuth
Publication date: 16 January 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/9301116
Related Items
Unnamed Item, Approximate map labeling is in \(\Omega (n\log n)\), A polynomial time solution for labeling a rectilinear map, Following a curve with the discrete Fréchet distance, Approximation algorithms on consistent dynamic map labeling, OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE, Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions, Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions, Generalised arc consistency for the AllDifferent constraint: an empirical survey, Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line, Minimum color spanning circle of imprecise points, Computing conforming partitions of orthogonal polygons with minimum stabbing number, Extending Partial Orthogonal Drawings, On the complexity of submap isomorphism and maximum common submap problems, An efficient and effective approximation algorithm for the Map Labeling Problem, Polynomial time algorithms for three-label point labeling., Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible, Removing local extrema from imprecise terrains, Unique assembly verification in two-handed self-assembly, Minimum color spanning circle in imprecise setup, On the complexity of clustering with relaxed size constraints in fixed dimension, Algorithmic aspects of proportional symbol maps, Computing orbit period in max-min algebra, Balanced location on a graph, Non-crossing Paths with Geographic Constraints, Independent dominating set problem revisited, LABELING POINTS ON A SINGLE LINE, The complexity of reasoning with global constraints, Covering segments with unit squares, Dispersing and grouping points on planar segments, Convex Quadrangulations of Bichromatic Point Sets, Maximum Area Axis-Aligned Square Packings., Matching colored points with rectangles, Matching points with rectangles and squares, Optimizing active ranges for consistent dynamic map labeling, A practical map labeling algorithm., EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING, LABELING A RECTILINEAR MAP WITH SLIDING LABELS, LABELING POINTS WITH CIRCLES, Dominating set of rectangles intersecting a straight line, Computing coverage kernels under restricted settings, Minimum membership covering and hitting, The Monotone Satisfiability Problem with Bounded Variable Appearances, Covering and packing of triangles intersecting a straight line, Covering and packing of rectilinear subdivision, Regular augmentation of planar graphs, Exploring and Triangulating a Region by a Swarm of Robots, Combinatorial optimization in system configuration design, On the Complexity of Clustering with Relaxed Size Constraints, Untangling a planar graph, The reach of axis-aligned squares in the plane, Multi-colored spanning graphs, Planar 3-SAT with a clause/variable cycle, Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity, Extending Partial Orthogonal Drawings, Systems of distant representatives in Euclidean space, The hardness of placing street names in a Manhattan type map, The complexity of separating points in the plane
