• Publications
  • Influence
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
TLDR
We prove that if the d-regular multigraph does not contain more than ⌊d/2⌋ copies of any 2-cycles then we can find a similar decomposition into n2 pairs of cycle covers where each 2-cycle occurs in at most one component of each pair. Expand
  • 197
  • 21
  • PDF
The greedy algorithm for shortest superstrings
  • 52
  • 9
Path Minima in Incremental Unrooted Trees
TLDR
A dynamic forest of unrooted trees over a set of nvertices which we update by linkoperations: Each link operation adds a new edge adjacent to vertices in two different trees. Expand
  • 8
  • 5
Meldable heaps and boolean union-find
TLDR
We consider a weaker version of the union-find problem where decrease-key and delete get only the item but not the heap containing it. Expand
  • 42
  • 4
  • PDF
The greedy algorithm for edit distance with moves
  • 27
  • 3
Union-find with deletions
TLDR
In the classical union-find problem we maintain a partition of a universe of <i>n</i> elements into disjoint sets subject to the operations union and find. Expand
  • 30
  • 3
  • PDF
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
TLDR
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. Expand
  • 13
  • 1
Data structures for mergeable trees
TLDR
A novel variant of the problem of efficiently maintaining a forest of dynamic rooted trees, in which arbitrary arc deletions (cuts) do not occur, we give a method that takes O(log n) time per operation, including merging. Expand
  • 5
  • 1
  • PDF
Finding the Position of the k-Mismatch and Approximate Tandem Repeats
TLDR
We give an algorithm that finds the exact index of the k-mismatch of P with the suffix of T starting at position j. Expand
  • 5
  • PDF
Finding Path Minima in Incremental Unrooted Trees ∗
Consider a dynamic forest of unrooted trees over a set of n vertices which we update by link operations: Each link operation adds a new edge adjacent to vertices in two different trees. Every edge inExpand