Maintenance of a Piercing Set for Intervals with Applications

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Algorithmica

• Publication date

  2000-12-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00453-002-1006-1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Generalized Shooter Location Problem

  1999cited by this paper
• Shooter location problems revisited

  1997influential reference
• Fast stabbing of boxes in high dimensions

  1996cited by this paper
• Shooter Location Problem

  1996cited by this paper
• Limited Gaps

  1994cited by this paper
• Cutting hyperplanes for divide-and-conquer

  1993cited by this paper
• Linear Time Algorithms on Circular-Arc Graphs

  1991influential reference
• Minimum Cuts for Circular-Arc Graphs

  1990cited by this paper
• Parallel Algorithms on Circular-Arc Graphs

  1990cited by this paper
• Optimal Parallel Algorithms on Circular-Arc Graphs

  1989cited by this paper
• Stability in Circular Arc Graphs

  1988cited by this paper
• An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph

  1988cited by this paper
• Data structures and network algorithms

  1983influential reference
• Efficient algorithms for interval graphs and circular-arc graphs

  1982cited by this paper
• Optimal Packing and Covering in the Plane are NP-Complete

  1981cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited by this paper

• Online Epsilon Net and Piercing Set for Geometric Concepts

  2024cites this paper
• Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching

  2024cites this paper
• Online Geometric Covering and Piercing

  2023cites this paper
• Stabbing boxes with finitely many axis-parallel lines and flats

  2023cites this paper
• Online Piercing of Geometric Objects

  2022cites this paper
• A linear-time algorithm for minimum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e529" altimg="si17.svg"><mml:mi>k</mml:mi></mml:math>-hop dominating set of a cactus graph

  2022cites this paper
• Approval Voting in Circular Societies: Piercing Numbers and Agreement

  2020cites this paper
• A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph

  2020cites this paper
• Piercing Numbers in Circular Societies

  2020cites this paper
• Dynamic algorithms for monotonic interval scheduling problem

  2014cites this paper
• Evader interdiction: algorithms, complexity and collateral damage

  2013cites this paper
• Dynamising Interval Scheduling: The Monotonic Case

  2013cites this paper
• The Aligned k-Center Problem

  2011cites this paper
• Computing k-Centers On a Line

  2009cites this paper
• Input-sensitive scalable continuous join query processing

  2009cites this paper
• A Vector Assignment Approach for the Graph Coloring Problem

  2008cites this paper
• Handling Resource Constraints and Scalability in Continuous Query Processing

  2007cites this paper
• Geometric facility location under continuous motion: bounded-velocity approximations to the mobile euclidean k-centre and k-median problems

  2006cites this paper
• Scalable continuous query processing by tracking hotspots

  2006cites this paper
• Approximation Algorithms for Rectangle Piercing Problems

  2005cites this paper
• Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane

  2004cites this paper
• Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks

  2002cites this paper
• Online Piercing of Geometric Objects 1

  year unknowncites this paper