Efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications
Saved in:
| Format: | Electronic eBook |
|---|---|
| Language: | English |
| Published: |
Berlin [u.a.]
Springer
2006
|
| Series: | Lecture notes in computer science
3484 |
| Subjects: | |
| Online Access: | DE-634 DE-M347 DE-91 DE-384 DE-473 DE-19 DE-355 DE-706 DE-739 Volltext |
| Physical Description: | 1 Online-Ressource (VI, 347 S.) graph. Darst. |
| ISBN: | 3540322124 9783540322122 |
| DOI: | 10.1007/11671541 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV022358697 | ||
| 003 | DE-604 | ||
| 005 | 20220802 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 070321s2006 gw d||| o|||| 00||| eng d | ||
| 015 | |a 06,N07,0016 |2 dnb | ||
| 020 | |a 3540322124 |9 3-540-32212-4 | ||
| 020 | |a 9783540322122 |9 978-3-540-32212-2 | ||
| 024 | 7 | |a 10.1007/11671541 |2 doi | |
| 035 | |a (OCoLC)723683782 | ||
| 035 | |a (DE-599)BVBBV022358697 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-473 |a DE-739 |a DE-706 |a DE-19 |a DE-91 |a DE-384 |a DE-M347 |a DE-634 |a DE-355 | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a DAT 000 |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 1 Online-Ressource (VI, 347 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 3484 | |
| 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)BV014880109 |9 3484 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/11671541 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015568068 | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-634 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-M347 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-91 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-384 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-473 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-19 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-355 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-706 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/11671541 |l DE-739 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1820875007523291136 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author_GND | (DE-588)120527250X |
| building | Verbundindex |
| bvnumber | BV022358697 |
| classification_rvk | SS 4800 |
| classification_tum | MAT 913f DAT 537f DAT 000 |
| collection | ZDB-2-SCS |
| ctrlnum | (OCoLC)723683782 (DE-599)BVBBV022358697 |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/11671541 |
| format | Electronic eBook |
| 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">BV022358697</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220802</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">070321s2006 gw d||| o|||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">06,N07,0016</subfield><subfield code="2">dnb</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="024" ind1="7" ind2=" "><subfield code="a">10.1007/11671541</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)723683782</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022358697</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-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-355</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="084" ind1=" " ind2=" "><subfield code="a">DAT 000</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">1 Online-Ressource (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">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">Lecture notes in computer science</subfield><subfield code="v">3484</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)BV014880109</subfield><subfield code="9">3484</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015568068</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/11671541</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV022358697 |
| illustrated | Illustrated |
| index_date | 2024-07-02T17:02:26Z |
| indexdate | 2025-01-10T15:08:47Z |
| institution | BVB |
| isbn | 3540322124 9783540322122 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015568068 |
| oclc_num | 723683782 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-739 DE-706 DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-384 DE-M347 DE-634 DE-355 DE-BY-UBR |
| owner_facet | DE-473 DE-BY-UBG DE-739 DE-706 DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-384 DE-M347 DE-634 DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (VI, 347 S.) graph. Darst. |
| psigel | ZDB-2-SCS |
| 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 1 Online-Ressource (VI, 347 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 3484 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)BV014880109 3484 https://doi.org/10.1007/11671541 Verlag Volltext |
| spellingShingle | Efficient approximation and online algorithms recent progress on classical combinatorial optimization problems and new applications Lecture notes in computer science 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 | Approximationsalgorithmus (DE-588)4500954-5 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Online-Algorithmus (DE-588)4583199-3 gnd |
| topic_facet | Approximationsalgorithmus Kombinatorische Optimierung Online-Algorithmus |
| url | https://doi.org/10.1007/11671541 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT bampisevripidis efficientapproximationandonlinealgorithmsrecentprogressonclassicalcombinatorialoptimizationproblemsandnewapplications |