Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Universitätsverl. der TU Berlin
2014
|
| Schriftenreihe: | Foundations of Computing
01 |
| Schlagworte: | |
| Online-Zugang: | Volltext Volltext Volltext |
| Beschreibung: | 1 Online-Ressource |
| Format: | Langzeitarchivierung gewährleistet, LZA |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042486927 | ||
| 003 | DE-604 | ||
| 005 | 20191009 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150408s2014 gw |||| o||u| ||||||eng d | ||
| 016 | 7 | |a 1067386459 |2 DE-101 | |
| 024 | 7 | |a urn:nbn:de:kobv:83-opus4-55292 |2 urn | |
| 035 | |a (OCoLC)904839286 | ||
| 035 | |a (DE-599)DNB1067386459 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-634 | ||
| 082 | 0 | |a 511.5 |2 22/ger | |
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Bevern, René van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications |c René van Bevern |
| 246 | 1 | 3 | |a Festparameter-Linearzeitalgorithmen für NP-schwere Graphen- und Hypergraphenprobleme aus industriellen Anwendungen |
| 264 | 1 | |a Berlin |b Universitätsverl. der TU Berlin |c 2014 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Foundations of Computing |v 01 | |
| 538 | |a Langzeitarchivierung gewährleistet, LZA | ||
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Hypergraph |0 (DE-588)4161063-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |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 Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 653 | |a scheduling | ||
| 653 | |a clustering | ||
| 653 | |a automata | ||
| 653 | |a data reduction | ||
| 653 | |a exact algorithms | ||
| 653 | |a Ablaufplanung | ||
| 653 | |a Clustering | ||
| 653 | |a Automaten | ||
| 653 | |a Datenreduktion | ||
| 653 | |a exakte Algorithmen | ||
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 0 | 1 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 2 | |a Hypergraph |0 (DE-588)4161063-5 |D s |
| 689 | 0 | 3 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 4 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Foundations of Computing |v 01 |w (DE-604)BV044943050 |9 01 | |
| 856 | 4 | 0 | |u https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292 |x Resolving-System |3 Volltext |
| 856 | 4 | 0 | |u http://d-nb.info/1067386459/34 |x Langzeitarchivierung Nationalbibliothek |3 Volltext |
| 856 | 4 | 0 | |u http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/5529 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027921787 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153220382064640 |
|---|---|
| any_adam_object | |
| author | Bevern, René van |
| author_facet | Bevern, René van |
| author_role | aut |
| author_sort | Bevern, René van |
| author_variant | r v b rv rvb |
| building | Verbundindex |
| bvnumber | BV042486927 |
| collection | ebook |
| ctrlnum | (OCoLC)904839286 (DE-599)DNB1067386459 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02685nmm a2200685zcb4500</leader><controlfield tag="001">BV042486927</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20191009 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150408s2014 gw |||| o||u| ||||||eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1067386459</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">urn:nbn:de:kobv:83-opus4-55292</subfield><subfield code="2">urn</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)904839286</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1067386459</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-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bevern, René van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications</subfield><subfield code="c">René van Bevern</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Festparameter-Linearzeitalgorithmen für NP-schwere Graphen- und Hypergraphenprobleme aus industriellen Anwendungen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverl. der TU Berlin</subfield><subfield code="c">2014</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="490" ind1="1" ind2=" "><subfield code="a">Foundations of Computing</subfield><subfield code="v">01</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Langzeitarchivierung gewährleistet, LZA</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</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="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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">scheduling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">clustering</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">automata</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">data reduction</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">exact algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ablaufplanung</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Clustering</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Automaten</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Datenreduktion</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">exakte Algorithmen</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><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">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of Computing</subfield><subfield code="v">01</subfield><subfield code="w">(DE-604)BV044943050</subfield><subfield code="9">01</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://d-nb.info/1067386459/34</subfield><subfield code="x">Langzeitarchivierung Nationalbibliothek</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/5529</subfield><subfield code="x">Verlag</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-027921787</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042486927 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:23:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027921787 |
| oclc_num | 904839286 |
| open_access_boolean | 1 |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource |
| psigel | ebook |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Universitätsverl. der TU Berlin |
| record_format | marc |
| series | Foundations of Computing |
| series2 | Foundations of Computing |
| spelling | Bevern, René van Verfasser aut Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications René van Bevern Festparameter-Linearzeitalgorithmen für NP-schwere Graphen- und Hypergraphenprobleme aus industriellen Anwendungen Berlin Universitätsverl. der TU Berlin 2014 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Foundations of Computing 01 Langzeitarchivierung gewährleistet, LZA Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Hypergraph (DE-588)4161063-5 gnd rswk-swf NP-hartes Problem (DE-588)4621705-8 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf scheduling clustering automata data reduction exact algorithms Ablaufplanung Clustering Automaten Datenreduktion exakte Algorithmen 1\p (DE-588)4113937-9 Hochschulschrift gnd-content NP-hartes Problem (DE-588)4621705-8 s Graph (DE-588)4021842-9 s Hypergraph (DE-588)4161063-5 s Berechnungskomplexität (DE-588)4134751-1 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 Foundations of Computing 01 (DE-604)BV044943050 01 https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292 Resolving-System Volltext http://d-nb.info/1067386459/34 Langzeitarchivierung Nationalbibliothek Volltext http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/5529 Verlag kostenfrei Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Bevern, René van Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications Foundations of Computing Berechnungskomplexität (DE-588)4134751-1 gnd Hypergraph (DE-588)4161063-5 gnd NP-hartes Problem (DE-588)4621705-8 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4134751-1 (DE-588)4161063-5 (DE-588)4621705-8 (DE-588)4125422-3 (DE-588)4021842-9 (DE-588)4113937-9 |
| title | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications |
| title_alt | Festparameter-Linearzeitalgorithmen für NP-schwere Graphen- und Hypergraphenprobleme aus industriellen Anwendungen |
| title_auth | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications |
| title_exact_search | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications |
| title_full | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications René van Bevern |
| title_fullStr | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications René van Bevern |
| title_full_unstemmed | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications René van Bevern |
| title_short | Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications |
| title_sort | fixed parameter linear time algorithms for np hard graph and hypergraph problems arising in industrial applications |
| topic | Berechnungskomplexität (DE-588)4134751-1 gnd Hypergraph (DE-588)4161063-5 gnd NP-hartes Problem (DE-588)4621705-8 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Berechnungskomplexität Hypergraph NP-hartes Problem Effizienter Algorithmus Graph Hochschulschrift |
| url | https://nbn-resolving.org/urn:nbn:de:kobv:83-opus4-55292 http://d-nb.info/1067386459/34 http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/5529 |
| volume_link | (DE-604)BV044943050 |
| work_keys_str_mv | AT bevernrenevan fixedparameterlineartimealgorithmsfornphardgraphandhypergraphproblemsarisinginindustrialapplications AT bevernrenevan festparameterlinearzeitalgorithmenfurnpschweregraphenundhypergraphenproblemeausindustriellenanwendungen |