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