Efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2006
|
Schriftenreihe: | Lecture notes in computer science
3484 |
Schlagworte: | |
Online-Zugang: | Inhaltstext |
Beschreibung: | VI, 347 S. graph. Darst. |
ISBN: | 3540322124 9783540322122 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV021499969 | ||
003 | DE-604 | ||
005 | 20220802 | ||
007 | t| | ||
008 | 060307s2006 gw d||| |||| 00||| eng d | ||
015 | |a 06,N07,0016 |2 dnb | ||
016 | 7 | |a 978048253 |2 DE-101 | |
020 | |a 3540322124 |9 3-540-32212-4 | ||
020 | |a 9783540322122 |9 978-3-540-32212-2 | ||
035 | |a (OCoLC)64581093 | ||
035 | |a (DE-599)BVBBV021499969 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-20 |a DE-91G |a DE-824 |a DE-706 |a DE-634 |a DE-83 |a DE-11 | ||
050 | 0 | |a QA76.9.A43 | |
082 | 0 | |a 005.1 |2 22 | |
084 | |a MAT 913f |2 stub | ||
084 | |a 004 |2 sdnb | ||
084 | |a DAT 537f |2 stub | ||
245 | 1 | 0 | |a Efficient approximation and online algorithms |b recent progress on classical combinatorial optimization problems and new applications |c Evripidis Bampis ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2006 | |
300 | |a VI, 347 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 3484 | |
650 | 4 | |a Algorithmes en ligne | |
650 | 4 | |a Optimisation combinatoire | |
650 | 4 | |a Datenverarbeitung | |
650 | 4 | |a Combinatorial optimization |x Data processing | |
650 | 4 | |a Computer algorithms | |
650 | 4 | |a Online algorithms | |
650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Online-Algorithmus |0 (DE-588)4583199-3 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 0 | 2 | |a Online-Algorithmus |0 (DE-588)4583199-3 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Bampis, Evripidis |e Sonstige |0 (DE-588)120527250X |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 3484 |w (DE-604)BV000000607 |9 3484 | |
856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=2762108&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-014716708 |
Datensatz im Suchindex
_version_ | 1820874980837031936 |
---|---|
adam_text | |
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author_GND | (DE-588)120527250X |
building | Verbundindex |
bvnumber | BV021499969 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.9.A43 |
callnumber-search | QA76.9.A43 |
callnumber-sort | QA 276.9 A43 |
callnumber-subject | QA - Mathematics |
classification_rvk | SS 4800 |
classification_tum | MAT 913f DAT 537f |
ctrlnum | (OCoLC)64581093 (DE-599)BVBBV021499969 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
discipline_str_mv | Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV021499969</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220802</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">060307s2006 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,N07,0016</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">978048253</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540322124</subfield><subfield code="9">3-540-32212-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540322122</subfield><subfield code="9">978-3-540-32212-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)64581093</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021499969</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="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-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 913f</subfield><subfield code="2">stub</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">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient approximation and online algorithms</subfield><subfield code="b">recent progress on classical combinatorial optimization problems and new applications</subfield><subfield code="c">Evripidis Bampis ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 347 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">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">Lecture notes in computer science</subfield><subfield code="v">3484</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes en ligne</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimisation combinatoire</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Online algorithms</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">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Online-Algorithmus</subfield><subfield code="0">(DE-588)4583199-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bampis, Evripidis</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)120527250X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">3484</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">3484</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=2762108&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-014716708</subfield></datafield></record></collection> |
id | DE-604.BV021499969 |
illustrated | Illustrated |
index_date | 2024-07-02T14:15:10Z |
indexdate | 2025-01-10T15:08:22Z |
institution | BVB |
isbn | 3540322124 9783540322122 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-014716708 |
oclc_num | 64581093 |
open_access_boolean | |
owner | DE-20 DE-91G DE-BY-TUM DE-824 DE-706 DE-634 DE-83 DE-11 |
owner_facet | DE-20 DE-91G DE-BY-TUM DE-824 DE-706 DE-634 DE-83 DE-11 |
physical | VI, 347 S. graph. Darst. |
publishDate | 2006 |
publishDateSearch | 2006 |
publishDateSort | 2006 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications Evripidis Bampis ... (eds.) Berlin [u.a.] Springer 2006 VI, 347 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 3484 Algorithmes en ligne Optimisation combinatoire Datenverarbeitung Combinatorial optimization Data processing Computer algorithms Online algorithms Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Online-Algorithmus (DE-588)4583199-3 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Approximationsalgorithmus (DE-588)4500954-5 s Online-Algorithmus (DE-588)4583199-3 s DE-604 Bampis, Evripidis Sonstige (DE-588)120527250X oth Lecture notes in computer science 3484 (DE-604)BV000000607 3484 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=2762108&prov=M&dok_var=1&dok_ext=htm Inhaltstext |
spellingShingle | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications Lecture notes in computer science Algorithmes en ligne Optimisation combinatoire Datenverarbeitung Combinatorial optimization Data processing Computer algorithms Online algorithms Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Online-Algorithmus (DE-588)4583199-3 gnd |
subject_GND | (DE-588)4500954-5 (DE-588)4031826-6 (DE-588)4583199-3 |
title | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications |
title_auth | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications |
title_exact_search | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications |
title_exact_search_txtP | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications |
title_full | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications Evripidis Bampis ... (eds.) |
title_fullStr | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications Evripidis Bampis ... (eds.) |
title_full_unstemmed | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications Evripidis Bampis ... (eds.) |
title_short | Efficient approximation and online algorithms |
title_sort | efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications |
title_sub | recent progress on classical combinatorial optimization problems and new applications |
topic | Algorithmes en ligne Optimisation combinatoire Datenverarbeitung Combinatorial optimization Data processing Computer algorithms Online algorithms Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Online-Algorithmus (DE-588)4583199-3 gnd |
topic_facet | Algorithmes en ligne Optimisation combinatoire Datenverarbeitung Combinatorial optimization Data processing Computer algorithms Online algorithms Approximationsalgorithmus Kombinatorische Optimierung Online-Algorithmus |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=2762108&prov=M&dok_var=1&dok_ext=htm |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT bampisevripidis efficientapproximationandonlinealgorithmsrecentprogressonclassicalcombinatorialoptimizationproblemsandnewapplications |