Interval Stabbing Problems in Small Integer Ranges

DOI10.1007/978-3-642-10631-6_18MaRDI QIDQ3652202zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jens M. Schmidt

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_18

zbMATH Keywords

discreteinterval intersectioninterval stabbingpoint enclosurestatic

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Data structures (68P05)

Recommendations

• Algorithms – ESA 2004
• Integer programming approaches for minimum stabbing problems
• Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
• The interval subset sum problem
• Fixed-parameter tractability and lower bounds for stabbing problems
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 903770
• A lower bound for range enclosure in interval arithmetic
• Short interval results for a class of integers
• An analysis of arithmetic constraints on integer intervals

Cited in

(8)

• Minimal unique palindromic substrings after single-character substitution
• Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
• An optimal dynamic data structure for stabbing-semigroup queries
• Space efficient dynamic stabbing with fast queries
• Integer programming approaches for minimum stabbing problems
• Twin-width. III: Max independent set, min dominating set, and coloring
• Pattern mining under Simon's congruence
• Assessing the accuracy of externalities prediction in a LCFS-PR M/G/1 queue under partial information

This page was built for publication: Interval Stabbing Problems in Small Integer Ranges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652202)