On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
Approximations and optimal geometric divide-and-conquer
Selected papers of the 23rd annual ACM symposium on Theory of computing
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
A Method for the Solution of the Nth Best Path Problem
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Solving Inverse Spanning Tree Problems Through Network Flow Techniques
Operations Research
Parametric and Kinetic Minimum Spanning Trees
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Möbius Transformations for Information Visualization and Meshing
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Inverse Parametric Sequence Alignment
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Learning to align: a statistical approach
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
| Hi-index | 0.00 |
We introduce a class of "inverse parametric optimization" problems, in which one is given both a parametric optimization problem and a desired optimal solution; the task is to determine parameter values that lead to the given solution. We describe algorithms for solving such problems for minimum spanning trees, shortest paths, and other "optimal sub-graph" problems, and discuss applications in multicast routing, vehicle path planning, resource allocation, and board game programming.