| Title: | The obnoxious center problem on weighted cactus graphs |
|---|
| Authors: | ID Zmazek, Blaž (Author)
ID Žerovnik, Janez (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/S1571-0653(05)80099-X
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.12 - Published Scientific Conference Contribution Abstract |
|---|
| Organization: | PEF - Faculty of Education
|
|---|
| Abstract: | The obnoxious center problem in a graph ▫$G$▫ asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. An algorithm is given which finds the obnoxious center on a weighted cactus graph in ▫$O(cn)$▫ time, where ▫$n$▫ is the number of vertices and ▫$c$▫ is the number of different vertex weights (called marks). |
|---|
| Keywords: | matematika, operacijsko raziskovanje, teorija grafov, lokacijski problemi, problem centra, nezaželjeni centri, algoritmi z linearno časovno zahtevnostjo, mathematics, operations research, graph theory, location problems, center problem, obnoxious facilities, linear time algorithm |
|---|
| Year of publishing: | 2001 |
|---|
| Number of pages: | str. 133-136 |
|---|
| Numbering: | Vol. 8 |
|---|
| PID: | 20.500.12556/DKUM-51507  |
|---|
| UDC: | 519.86:519.17 |
|---|
| ISSN on article: | 1571-0653 |
|---|
| COBISS.SI-ID: | 13824345 |
|---|
| NUK URN: | URN:SI:UM:DK:BSM23PYM |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1502 |
|---|
| Downloads: | 107 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
