Path optimization and near-greedy analysis for graph partitioning: an empirical study

Authors:
Jonathan Berry;Mark Goldberg
Affiliations:
Resselaer Polytechnic Institute;Resselaer Polytechnic Institute
Venue:
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Year:
1995

Citing 6
Cited 1

The maximum concurrent flow problem

Journal of the ACM (JACM)
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Finding near-optimal cuts: an empirical evaluation

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

A learning algorithm for the longest common subsequence problem

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract