### Abstract

In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7-approximation algorithm for general cases.

Original language | English |
---|---|

Title of host publication | Theory of Computing 2011 - Proceedings of the 17th Computing |

Subtitle of host publication | The Australasian Theory Symposium, CATS 2011 |

Pages | 137-143 |

Number of pages | 7 |

Publication status | Published - Dec 1 2011 |

Externally published | Yes |

Event | Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 - Perth, WA, Australia Duration: Jan 17 2011 → Jan 20 2011 |

### Publication series

Name | Conferences in Research and Practice in Information Technology Series |
---|---|

Volume | 119 |

ISSN (Print) | 1445-1336 |

### Other

Other | Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 |
---|---|

Country | Australia |

City | Perth, WA |

Period | 1/17/11 → 1/20/11 |

### All Science Journal Classification (ASJC) codes

- Computer Networks and Communications
- Computer Science Applications
- Hardware and Architecture
- Information Systems
- Software

## Fingerprint Dive into the research topics of 'Approximation algorithms for data association problem arising from multitarget tracking'. Together they form a unique fingerprint.

## Cite this

Kamiyama, N., & Matsui, T. (2011). Approximation algorithms for data association problem arising from multitarget tracking. In

*Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011*(pp. 137-143). (Conferences in Research and Practice in Information Technology Series; Vol. 119).