Competetive and voting location: = Kompetitive und präferenzbasierte Standortprobleme
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
2010
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | Zsfassung in dt. und engl. Sprache |
| Beschreibung: | 1 Online-Ressource (188 S.) graph. Darst. |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036853799 | ||
| 003 | DE-604 | ||
| 005 | 20101209 | ||
| 006 | a m||| 00||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 101206s2010 |||| o||u| ||||||eng d | ||
| 024 | 7 | |a urn:nbn:de:bvb:20-opus-52978 |2 urn | |
| 035 | |a (OCoLC)706036495 | ||
| 035 | |a (DE-599)BVBBV036853799 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 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-706 |a DE-20 |a DE-1102 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Spoerhase, Joachim |e Verfasser |0 (DE-588)142987727 |4 aut | |
| 245 | 1 | 0 | |a Competetive and voting location |b = Kompetitive und präferenzbasierte Standortprobleme |c Joachim Spoerhase |
| 246 | 1 | 1 | |a Kompetitive und präferenzbasierte Standortprobleme |
| 264 | 1 | |c 2010 | |
| 300 | |a 1 Online-Ressource (188 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Zsfassung in dt. und engl. Sprache | ||
| 502 | |a Würzburg, Univ., Diss., 2010 | ||
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Standortproblem |0 (DE-588)4301515-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Standortproblem |0 (DE-588)4301515-3 |D s |
| 689 | 0 | 1 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 0 | 2 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 3 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | 4 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 0 | |s 1238 KB |u https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-52978 |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020769703 | ||
Datensatz im Suchindex
| _version_ | 1804143549744152576 |
|---|---|
| any_adam_object | |
| author | Spoerhase, Joachim |
| author_GND | (DE-588)142987727 |
| author_facet | Spoerhase, Joachim |
| author_role | aut |
| author_sort | Spoerhase, Joachim |
| author_variant | j s js |
| building | Verbundindex |
| bvnumber | BV036853799 |
| classification_rvk | ST 134 |
| collection | ebook |
| ctrlnum | (OCoLC)706036495 (DE-599)BVBBV036853799 |
| discipline | Informatik |
| format | Thesis Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01992nmm a2200481 c 4500</leader><controlfield tag="001">BV036853799</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20101209 </controlfield><controlfield tag="006">a m||| 00||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">101206s2010 |||| o||u| ||||||eng d</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:bvb:20-opus-52978</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)706036495</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036853799</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</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-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-1102</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Spoerhase, Joachim</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142987727</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Competetive and voting location</subfield><subfield code="b">= Kompetitive und präferenzbasierte Standortprobleme</subfield><subfield code="c">Joachim Spoerhase</subfield></datafield><datafield tag="246" ind1="1" ind2="1"><subfield code="a">Kompetitive und präferenzbasierte Standortprobleme</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (188 S.)</subfield><subfield code="b">graph. Darst.</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="500" ind1=" " ind2=" "><subfield code="a">Zsfassung in dt. und engl. Sprache</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Würzburg, Univ., Diss., 2010</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</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">Standortproblem</subfield><subfield code="0">(DE-588)4301515-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="s">1238 KB</subfield><subfield code="u">https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-52978</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</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-020769703</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV036853799 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T22:49:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020769703 |
| oclc_num | 706036495 |
| 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-706 DE-20 DE-1102 |
| 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-706 DE-20 DE-1102 |
| physical | 1 Online-Ressource (188 S.) graph. Darst. |
| psigel | ebook |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| record_format | marc |
| spelling | Spoerhase, Joachim Verfasser (DE-588)142987727 aut Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme Joachim Spoerhase Kompetitive und präferenzbasierte Standortprobleme 2010 1 Online-Ressource (188 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Zsfassung in dt. und engl. Sprache Würzburg, Univ., Diss., 2010 Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Standortproblem (DE-588)4301515-3 gnd rswk-swf NP-hartes Problem (DE-588)4621705-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Standortproblem (DE-588)4301515-3 s NP-hartes Problem (DE-588)4621705-8 s Approximationsalgorithmus (DE-588)4500954-5 s Effizienter Algorithmus (DE-588)4125422-3 s Graph (DE-588)4021842-9 s DE-604 1238 KB https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-52978 kostenfrei Volltext |
| spellingShingle | Spoerhase, Joachim Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme Approximationsalgorithmus (DE-588)4500954-5 gnd Graph (DE-588)4021842-9 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Standortproblem (DE-588)4301515-3 gnd NP-hartes Problem (DE-588)4621705-8 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4021842-9 (DE-588)4125422-3 (DE-588)4301515-3 (DE-588)4621705-8 (DE-588)4113937-9 |
| title | Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme |
| title_alt | Kompetitive und präferenzbasierte Standortprobleme |
| title_auth | Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme |
| title_exact_search | Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme |
| title_full | Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme Joachim Spoerhase |
| title_fullStr | Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme Joachim Spoerhase |
| title_full_unstemmed | Competetive and voting location = Kompetitive und präferenzbasierte Standortprobleme Joachim Spoerhase |
| title_short | Competetive and voting location |
| title_sort | competetive and voting location kompetitive und praferenzbasierte standortprobleme |
| title_sub | = Kompetitive und präferenzbasierte Standortprobleme |
| topic | Approximationsalgorithmus (DE-588)4500954-5 gnd Graph (DE-588)4021842-9 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Standortproblem (DE-588)4301515-3 gnd NP-hartes Problem (DE-588)4621705-8 gnd |
| topic_facet | Approximationsalgorithmus Graph Effizienter Algorithmus Standortproblem NP-hartes Problem Hochschulschrift |
| url | https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-52978 |
| work_keys_str_mv | AT spoerhasejoachim competetiveandvotinglocationkompetitiveundpraferenzbasiertestandortprobleme AT spoerhasejoachim kompetitiveundpraferenzbasiertestandortprobleme |