home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pipex!bnr.co.uk!uknet!mcsun!sunic!news.funet.fi!polaris!sara.cc.utu.fi!johnsson
- From: johnsson@sara.cc.utu.fi (MIKA JOHNSSON)
- Newsgroups: comp.theory
- Subject: Re: N-MATCHING INFO WANTED !
- Message-ID: <1992Dec22.134940.1@sara.cc.utu.fi>
- Date: 22 Dec 92 14:06:03 GMT
- References: <1992Dec18.140758.1@sara.cc.utu.fi>
- Sender: news@polaris.utu.fi (Usenet News admin)
- Organization: University of Turku, Finland
- Lines: 29
-
- In article <1992Dec18.140758.1@sara.cc.utu.fi>, johnsson@sara.cc.utu.fi (MIKA JOHNSSON) writes:
- > HI EVERYONE !
- >
- > I'm interested in 3-matching or n-Matching with n > 2
- >
- > If anyone knows any articles, books, etc. that deals with n-Matching algorithms
- > (heuristical or optimal) and their complexity, could you please inform me,
- >
- > Thanks in advance
-
- I'm very sorry that my original question was so poorly formulated that i
- bothered some people in vain, I should have mentioned that I'm interested in
- WEIGHTED matching (assignment) of higher degree than 2.
-
- My problem is like this: I have n independent points in XY-rectangle and i want
- to form groups (which each have k points) so that the total inner group
- distances are minimized (the graph is fully connected).
- With k=2 this can be done by assignment algorithm, but i'm interested cases
- where k>2, so if anyone knows articles etc. from this area please inform me.
- And many thanks to those who already helped me !
-
-
- Mika Johnsson
-
- >
- > Mika Johnsson
- > e-mail johnsson@sara.cc.utu.fi
- > Univerity of Turku, Finland
- >
-