Verfügbarkeit: Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows

Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Sensen, Norbert (VerfasserIn)
Format:	Abschlussarbeit Elektronisch E-Book
Sprache:	English
Veröffentlicht:	2003
Schlagworte:	Graph Dekomposition Untere Schranke Mehrgüter-Fluss-Problem Branch-and-Bound-Methode Hochschulschrift
Online-Zugang:	kostenfrei http://d-nb.info/971568243/34
Beschreibung:	1 Online-Ressource

Internformat

MARC


LEADER	00000nmm a2200000 c 4500
001	BV019735468
003	DE-604
005	00000000000000.0
006	a m\|\|\| 00\|\|\|
007	cr\|uuu---uuuuu
008	050314s2003 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
015			\|a 04,H08,0640 \|2 dnb
016	7		\|a 971568243 \|2 DE-101
035			\|a (OCoLC)1184080936
035			\|a (DE-599)BVBBV019735468
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c XA-DE
049			\|a DE-384 \|a DE-473 \|a DE-703 \|a DE-1051 \|a DE-824 \|a DE-29 \|a DE-12 \|a DE-91 \|a DE-19 \|a DE-1049 \|a DE-92 \|a DE-739 \|a DE-898 \|a DE-355 \|a DE-20
084			\|a 004 \|2 sdnb
084			\|a 510 \|2 sdnb
100	1		\|a Sensen, Norbert \|e Verfasser \|4 aut
245	1	0	\|a Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows \|c von Norbert Sensen
264		1	\|c 2003
300			\|a 1 Online-Ressource
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
502			\|a Paderborn, Univ., Diss., 2003
583	0		\|a Langzeitarchivierung in Der Deutschen Bibliothek gewährleistet
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Dekomposition \|0 (DE-588)4149030-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Untere Schranke \|0 (DE-588)4186970-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mehrgüter-Fluss-Problem \|0 (DE-588)4464169-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Branch-and-Bound-Methode \|0 (DE-588)4146449-7 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	0	1	\|a Dekomposition \|0 (DE-588)4149030-7 \|D s
689	0	2	\|a Untere Schranke \|0 (DE-588)4186970-9 \|D s
689	0	3	\|a Mehrgüter-Fluss-Problem \|0 (DE-588)4464169-2 \|D s
689	0	4	\|a Branch-and-Bound-Methode \|0 (DE-588)4146449-7 \|D s
689	0		\|5 DE-604
856	4		\|s ca. 1,0 MB \|u http://ubdata.uni-paderborn.de/ediss/17/2003/sensen/disserta.pdf \|z kostenfrei
856	4		\|u http://d-nb.info/971568243/34
912			\|a ebook
999			\|a oai:aleph.bib-bvb.de:BVB01-013062290

Datensatz im Suchindex

_version_	1804133199346925568
any_adam_object
author	Sensen, Norbert
author_facet	Sensen, Norbert
author_role	aut
author_sort	Sensen, Norbert
author_variant	n s ns
building	Verbundindex
bvnumber	BV019735468
collection	ebook
ctrlnum	(OCoLC)1184080936 (DE-599)BVBBV019735468
discipline	Informatik Mathematik
format	Thesis Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01993nmm a2200517 c 4500</leader><controlfield tag="001">BV019735468</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="006">a m\|\|\| 00\|\|\| </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">050314s2003 gw \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">04,H08,0640</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">971568243</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184080936</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019735468</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sensen, Norbert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows</subfield><subfield code="c">von Norbert Sensen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Paderborn, Univ., Diss., 2003</subfield></datafield><datafield tag="583" ind1="0" ind2=" "><subfield code="a">Langzeitarchivierung in Der Deutschen Bibliothek gewährleistet</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Untere Schranke</subfield><subfield code="0">(DE-588)4186970-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrgüter-Fluss-Problem</subfield><subfield code="0">(DE-588)4464169-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Untere Schranke</subfield><subfield code="0">(DE-588)4186970-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Mehrgüter-Fluss-Problem</subfield><subfield code="0">(DE-588)4464169-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="s">ca. 1,0 MB</subfield><subfield code="u">http://ubdata.uni-paderborn.de/ediss/17/2003/sensen/disserta.pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://d-nb.info/971568243/34</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-013062290</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV019735468
illustrated	Not Illustrated
indexdate	2024-07-09T20:04:55Z
institution	BVB
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-013062290
oclc_num	1184080936
open_access_boolean	1
owner	DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-20
owner_facet	DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-20
physical	1 Online-Ressource
psigel	ebook
publishDate	2003
publishDateSearch	2003
publishDateSort	2003
record_format	marc
spelling	Sensen, Norbert Verfasser aut Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows von Norbert Sensen 2003 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Paderborn, Univ., Diss., 2003 Langzeitarchivierung in Der Deutschen Bibliothek gewährleistet Graph (DE-588)4021842-9 gnd rswk-swf Dekomposition (DE-588)4149030-7 gnd rswk-swf Untere Schranke (DE-588)4186970-9 gnd rswk-swf Mehrgüter-Fluss-Problem (DE-588)4464169-2 gnd rswk-swf Branch-and-Bound-Methode (DE-588)4146449-7 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Graph (DE-588)4021842-9 s Dekomposition (DE-588)4149030-7 s Untere Schranke (DE-588)4186970-9 s Mehrgüter-Fluss-Problem (DE-588)4464169-2 s Branch-and-Bound-Methode (DE-588)4146449-7 s DE-604 ca. 1,0 MB http://ubdata.uni-paderborn.de/ediss/17/2003/sensen/disserta.pdf kostenfrei http://d-nb.info/971568243/34
spellingShingle	Sensen, Norbert Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows Graph (DE-588)4021842-9 gnd Dekomposition (DE-588)4149030-7 gnd Untere Schranke (DE-588)4186970-9 gnd Mehrgüter-Fluss-Problem (DE-588)4464169-2 gnd Branch-and-Bound-Methode (DE-588)4146449-7 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4149030-7 (DE-588)4186970-9 (DE-588)4464169-2 (DE-588)4146449-7 (DE-588)4113937-9
title	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
title_auth	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
title_exact_search	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
title_full	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows von Norbert Sensen
title_fullStr	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows von Norbert Sensen
title_full_unstemmed	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows von Norbert Sensen
title_short	Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
title_sort	lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
topic	Graph (DE-588)4021842-9 gnd Dekomposition (DE-588)4149030-7 gnd Untere Schranke (DE-588)4186970-9 gnd Mehrgüter-Fluss-Problem (DE-588)4464169-2 gnd Branch-and-Bound-Methode (DE-588)4146449-7 gnd
topic_facet	Graph Dekomposition Untere Schranke Mehrgüter-Fluss-Problem Branch-and-Bound-Methode Hochschulschrift
url	http://ubdata.uni-paderborn.de/ediss/17/2003/sensen/disserta.pdf http://d-nb.info/971568243/34
work_keys_str_mv	AT sensennorbert lowerboundsandexactalgorithmsforthegraphpartitioningproblemusingmulticommodityflows

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge