The Parametric Closure Problem
From MaRDI portal
Publication:3449830
DOI10.1007/978-3-319-21840-3_27zbMath1444.68061arXiv1504.04073OpenAlexW2771919888MaRDI QIDQ3449830
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science, ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04073
Related Items (3)
A stronger lower bound on parametric minimum spanning trees ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- The poset scheduling problem
- Geometric lower bounds for parametric matroid optimization
- Semiorders. Properties, representations, applications
- Tree-width and dimension
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs
- On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects
- Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
- Semiorders and a Theory of Utility Discrimination
- A New Algorithm for Computing the Maximal Closure of a Graph
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Self-adjusting binary search trees
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
- Small Superpatterns for Dominance Drawing
- Adjacency-Preserving Spatial Treemaps
- A Selection Problem of Shared Fixed Costs and Network Flows
- Notes—On a Selection Problem
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
This page was built for publication: The Parametric Closure Problem
