Setting parameters by example
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 50, 309-318
- https://doi.org/10.1109/sffcs.1999.814602
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning TreesSIAM Journal on Computing, 1998
- A simpler minimum spanning tree verification algorithmAlgorithmica, 1997
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning TreesSIAM Journal on Computing, 1997
- On the inverse problem of minimum spanning tree with partition constraintsMathematical Methods of Operations Research, 1996
- On geometric optimization with few violated constraintsDiscrete & Computational Geometry, 1995
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- An Algorithm for Finding K Minimum Spanning TreesSIAM Journal on Computing, 1981
- A Method for the Solution of the N th Best Path ProblemJournal of the ACM, 1959