Algorithms for interval structures with applications
DOI10.1016/J.TCS.2011.12.075zbMATH Open1325.05163OpenAlexW1998397869MaRDI QIDQ388095FDOQ388095
Authors: Danny Z. Chen, Ewa Misiołek 
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.075
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Preserving order in a forest in less than logarithmic time and linear space
- Algorithmic graph theory and perfect graphs
- A linear-time algorithm for a special case of disjoint set union
- A PTAS for TSP with neighborhoods among fat regions in the plane
- Title not available (Why is that?)
- Finding level-ancestors in trees
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Design and implementation of an efficient priority queue
- On a circle-cover minimization problem
- Title not available (Why is that?)
- A unified approach to domination problems on interval graphs
- Linear time algorithms on circular-arc graphs
- Computing minimum diameter color-spanning sets
- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- Chromatic nearest neighbor searching: A query sensitive approach
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- On intersecting a set of parallel line segments with a convex polygon of minimum area
- NP-Completeness of Spreading Colored Points
- Computing toolpaths for 5-axis NC machines
- Free-Form Surface Partition in 3-D
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Finding an optimal path without growing the tree
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- TSP with neighborhoods of varying size
- Automata, Languages and Programming
Cited In (8)
- Color-spanning localized query
- Algorithms for interval structures with applications
- Color spanning objects: algorithms and hardness results
- Minimum width color spanning annulus
- Minimum width color spanning annulus
- Shortest color-spanning intervals
- Color spanning objects: algorithms and hardness results
- Computing largest minimum color-spanning intervals of imprecise points
This page was built for publication: Algorithms for interval structures with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388095)
