An easily computable lower bound for the graph partitioning problem:
Abstract: "We develop an easily computable lower bound for the Weighted Graph 2-Partitioning Problem and its generalization to the Weighted Graph k-Partitioning Problem. The bound is an improvement of a previously published bound by the first and last author. The complexity of the general lower...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
København
DIKU
1996
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1996,18 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We develop an easily computable lower bound for the Weighted Graph 2-Partitioning Problem and its generalization to the Weighted Graph k-Partitioning Problem. The bound is an improvement of a previously published bound by the first and last author. The complexity of the general lower-bound computation is O(kn²). In the case of graph 2- partitioning the complexity of the lower-bound computation is O(m+n). The on-line complexity of computing the increase in the lower bound when a new vertex is assigned to one set of a partial 2-partitioning can be reduced to O(n) if O(n) partial results from the previous lower-bound computation are stored, and if the sequence of vertex assignments is fixed. A Branch-and- Bound algorithm based hereon is implemented and preliminary computational results are reported." |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035229132 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 081229s1996 |||| 00||| eng d | ||
| 035 | |a (OCoLC)38340544 | ||
| 035 | |a (DE-599)GBV268799253 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Clausen, Jens |d 1950- |e Verfasser |0 (DE-588)132704528 |4 aut | |
| 245 | 1 | 0 | |a An easily computable lower bound for the graph partitioning problem |c Jens Clausen ; Andrea Sterbini ; Jesper larsson Träff |
| 264 | 1 | |a København |b DIKU |c 1996 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,18 | |
| 520 | 3 | |a Abstract: "We develop an easily computable lower bound for the Weighted Graph 2-Partitioning Problem and its generalization to the Weighted Graph k-Partitioning Problem. The bound is an improvement of a previously published bound by the first and last author. The complexity of the general lower-bound computation is O(kn²). In the case of graph 2- partitioning the complexity of the lower-bound computation is O(m+n). The on-line complexity of computing the increase in the lower bound when a new vertex is assigned to one set of a partial 2-partitioning can be reduced to O(n) if O(n) partial results from the previous lower-bound computation are stored, and if the sequence of vertex assignments is fixed. A Branch-and- Bound algorithm based hereon is implemented and preliminary computational results are reported." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Partitions (Mathematics) | |
| 700 | 1 | |a Sterbini, Andrea |e Verfasser |4 aut | |
| 700 | 1 | |a Träff, Jesper Larsson |e Verfasser |4 aut | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,18 |w (DE-604)BV010011493 |9 96,18 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017035102 | ||
Datensatz im Suchindex
| _version_ | 1804138495891996672 |
|---|---|
| any_adam_object | |
| author | Clausen, Jens 1950- Sterbini, Andrea Träff, Jesper Larsson |
| author_GND | (DE-588)132704528 |
| author_facet | Clausen, Jens 1950- Sterbini, Andrea Träff, Jesper Larsson |
| author_role | aut aut aut |
| author_sort | Clausen, Jens 1950- |
| author_variant | j c jc a s as j l t jl jlt |
| building | Verbundindex |
| bvnumber | BV035229132 |
| ctrlnum | (OCoLC)38340544 (DE-599)GBV268799253 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01996nam a2200349 cb4500</leader><controlfield tag="001">BV035229132</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081229s1996 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38340544</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV268799253</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clausen, Jens</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132704528</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An easily computable lower bound for the graph partitioning problem</subfield><subfield code="c">Jens Clausen ; Andrea Sterbini ; Jesper larsson Träff</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="b">DIKU</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,18</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We develop an easily computable lower bound for the Weighted Graph 2-Partitioning Problem and its generalization to the Weighted Graph k-Partitioning Problem. The bound is an improvement of a previously published bound by the first and last author. The complexity of the general lower-bound computation is O(kn²). In the case of graph 2- partitioning the complexity of the lower-bound computation is O(m+n). The on-line complexity of computing the increase in the lower bound when a new vertex is assigned to one set of a partial 2-partitioning can be reduced to O(n) if O(n) partial results from the previous lower-bound computation are stored, and if the sequence of vertex assignments is fixed. A Branch-and- Bound algorithm based hereon is implemented and preliminary computational results are reported."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitions (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sterbini, Andrea</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Träff, Jesper Larsson</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,18</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">96,18</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017035102</subfield></datafield></record></collection> |
| id | DE-604.BV035229132 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017035102 |
| oclc_num | 38340544 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | DIKU |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Clausen, Jens 1950- Verfasser (DE-588)132704528 aut An easily computable lower bound for the graph partitioning problem Jens Clausen ; Andrea Sterbini ; Jesper larsson Träff København DIKU 1996 14 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1996,18 Abstract: "We develop an easily computable lower bound for the Weighted Graph 2-Partitioning Problem and its generalization to the Weighted Graph k-Partitioning Problem. The bound is an improvement of a previously published bound by the first and last author. The complexity of the general lower-bound computation is O(kn²). In the case of graph 2- partitioning the complexity of the lower-bound computation is O(m+n). The on-line complexity of computing the increase in the lower bound when a new vertex is assigned to one set of a partial 2-partitioning can be reduced to O(n) if O(n) partial results from the previous lower-bound computation are stored, and if the sequence of vertex assignments is fixed. A Branch-and- Bound algorithm based hereon is implemented and preliminary computational results are reported." Branch and bound algorithms Combinatorial optimization Graph theory Partitions (Mathematics) Sterbini, Andrea Verfasser aut Träff, Jesper Larsson Verfasser aut Datalogisk Institut <København>: DIKU-Rapport 1996,18 (DE-604)BV010011493 96,18 |
| spellingShingle | Clausen, Jens 1950- Sterbini, Andrea Träff, Jesper Larsson An easily computable lower bound for the graph partitioning problem Datalogisk Institut <København>: DIKU-Rapport Branch and bound algorithms Combinatorial optimization Graph theory Partitions (Mathematics) |
| title | An easily computable lower bound for the graph partitioning problem |
| title_auth | An easily computable lower bound for the graph partitioning problem |
| title_exact_search | An easily computable lower bound for the graph partitioning problem |
| title_full | An easily computable lower bound for the graph partitioning problem Jens Clausen ; Andrea Sterbini ; Jesper larsson Träff |
| title_fullStr | An easily computable lower bound for the graph partitioning problem Jens Clausen ; Andrea Sterbini ; Jesper larsson Träff |
| title_full_unstemmed | An easily computable lower bound for the graph partitioning problem Jens Clausen ; Andrea Sterbini ; Jesper larsson Träff |
| title_short | An easily computable lower bound for the graph partitioning problem |
| title_sort | an easily computable lower bound for the graph partitioning problem |
| topic | Branch and bound algorithms Combinatorial optimization Graph theory Partitions (Mathematics) |
| topic_facet | Branch and bound algorithms Combinatorial optimization Graph theory Partitions (Mathematics) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT clausenjens aneasilycomputablelowerboundforthegraphpartitioningproblem AT sterbiniandrea aneasilycomputablelowerboundforthegraphpartitioningproblem AT traffjesperlarsson aneasilycomputablelowerboundforthegraphpartitioningproblem |