Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Cited In (50)

An efficient algorithm for the parametric resource allocation problem
Generalization of a theorem on the parametric maximum flow problem
An improved branch-and-bound clustering approach for data partitioning
Structural and algorithmic properties for parametric minimum cuts
Constructing the minimization diagram of a two-parameter problem
Parametric methods in integer linear programming
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
Total variation on a tree
Total Variation in Imaging
A polynomial time algorithm for a deterministic joint pricing and inventory model
A faster algorithm for computing the principal sequence of partitions of a graph
Parametric multiple sequence alignment and phylogeny construction
EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
Parametric multiroute flow and its application to multilink-attack network
Approximating the Minimum Chain Completion problem
Parametric optimization of sequence alignment
A fast algorithm for the generalized parametric minimum cut problem and applications
Algorithms for flows with parametric capacities
Inventory control of service parts in the final phase: A central depot and repair kits
Maximizing residual flow under an arc destruction
Parametric stable marriage and minimum cuts
Improving the efficiency of decentralized supply chains with fixed ordering costs
Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries
A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
Balancing profits and costs on trees
Facility location models to locate data in information networks: a literature review
Modelling and solving an FMS part selection problem
Calculation of stability radii for combinatorial optimization problems
On weighting two criteria with a parameter in combinatorial optimization problems
Ordered optimal solutions and parametric minimum cut problems
Capacitated procurement planning with price-sensitive demand and general concave-revenue functions
An approximation algorithm for a general class of parametric optimization problems
Maximal closure on a graph with resource constraints
A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
A fast parametric assignment algorithm with applications in max-algebra
Una struttura bidimensionale per la memorizzazione dei file trasposti
Space-sweep algorithms for parametric optimization
On total variation minimization and surface evolution using parametric maximum flows
An approximation algorithm for a general class of multi-parametric optimization problems
Approximation schemes for the parametric knapsack problem
A parametric maximum flow algorithm for bipartite graphs with applications
A note on Stability of the constant cost dynamic lot size model by K. Richter
Using sparsification for parametric minimum spanning tree problems
On the p‐coverage problem on the real line
Parametric matroid interdiction
Efficient algorithms for robustness in resource allocation and scheduling problems
How good is the Chord algorithm?

This page was built for publication: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

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