Approximation algorithms for combinatorial optimization: third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2000
|
| Schriftenreihe: | Lecture notes in computer science
1913 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | IX, 273 S. |
| ISBN: | 3540679960 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV013309032 | ||
| 003 | DE-604 | ||
| 005 | 20041115 | ||
| 007 | t| | ||
| 008 | 000815s2000 gw |||| 10||| eng d | ||
| 016 | 7 | |a 959534547 |2 DE-101 | |
| 020 | |a 3540679960 |9 3-540-67996-0 | ||
| 035 | |a (OCoLC)44811692 | ||
| 035 | |a (DE-599)BVBBV013309032 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-91G |a DE-739 |a DE-703 |a DE-824 |a DE-706 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 004/.01/5114 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 913f |2 stub | ||
| 084 | |a MAT 410f |2 stub | ||
| 084 | |a 90C27 |2 msc | ||
| 245 | 1 | 0 | |a Approximation algorithms for combinatorial optimization |b third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings |c Klaus Jansen ; Samir Khuller (ed.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2000 | |
| 300 | |a IX, 273 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1913 | |
| 650 | 4 | |a Algorithmes - Congrès | |
| 650 | 7 | |a Algorithmes - Congrès |2 ram | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Algoritmos e estruturas de dados |2 larpcal | |
| 650 | 4 | |a Approximation, Théorie de l' - Informatique - Congrès | |
| 650 | 7 | |a Approximation, Théorie de l' - Informatique - Congrès |2 ram | |
| 650 | 7 | |a Aproximacao (analise numerica) |2 larpcal | |
| 650 | 7 | |a Benaderingen (wiskunde) |2 gtt | |
| 650 | 7 | |a Combinatorische meetkunde |2 gtt | |
| 650 | 7 | |a Matematica da computacao |2 larpcal | |
| 650 | 7 | |a Numerieke methoden |2 gtt | |
| 650 | 7 | |a Optimaliseren |2 gtt | |
| 650 | 4 | |a Optimisation combinatoire - Informatique - Congrès | |
| 650 | 7 | |a Optimisation combinatoire - Informatique - Congrès |2 ram | |
| 650 | 7 | |a algorithme approximation |2 inriac | |
| 650 | 7 | |a approximation |2 inriac | |
| 650 | 7 | |a complexité |2 inriac | |
| 650 | 7 | |a graphe |2 inriac | |
| 650 | 7 | |a optimisation combinatoire |2 inriac | |
| 650 | 7 | |a système aléatoire |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Approximation theory |x Data processing |v Congresses | |
| 650 | 4 | |a Combinatorial optimization |x Data processing |v Congresses | |
| 650 | 4 | |a Computer algorithms |v Congresses | |
| 650 | 0 | 7 | |a Approximation |0 (DE-588)4002498-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2000 |z Saarbrücken |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Approximation |0 (DE-588)4002498-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Jansen, Klaus |e Sonstige |4 oth | |
| 711 | 2 | |a APPROX |n 3 |d 2000 |c Saarbrücken |j Sonstige |0 (DE-588)10006814-5 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 1913 |w (DE-604)BV000000607 |9 1913 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009074572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009074572 | |
Datensatz im Suchindex
| _version_ | 1820874894747893760 |
|---|---|
| adam_text |
KLAU
S JANSE
N SAMIR KHULLER (EDS.)
APPROXIMATION ALGORITHMS
FOR COMBINATORIAL
OPTIMIZATION
THIRD INTERNATIONAL WORKSHOP, APPROX 2000
SAARBRUECKEN, GERMANY, SEPTEMBER 5-8, 2000
PROCEEDINGS
IP
L SPRINGE
R
CONTENT
S
INVITE
D TALK
S
APPROXIMATIO
N ALGORITHM
S THA
T TAK
E ADVIC
E
SANJEEV ARORA
INSTAN
T RECOGNITIO
N OF POLYNOMIA
L TIM
E SOLVABILITY, HALF
INTEGRALIT
Y AN
D 2-APPROXIMATION
S
DORIT S. HOCHBAUM
SCHEDULING UNDE
R UNCERTAINTY
: OPTIMIZIN
G AGAINS
T A
RANDOMIZIN
G ADVERSAR
Y
ROLF H. MOEHRING
APPROXIMATIO
N ALGORITHM
S FOR FACILITY LOCATIO
N PROBLEM
S
DAVID B. SHMOYS
CONTRIBUTE
D TALK
S
A
N APPROXIMATIO
N ALGORITH
M FOR MA
X DICU
T WIT
H GIVEN
SIZES OF PART
S
ALEXANDER AGEEV, REFAEL HASSIN AND MAXIM SVIRIDENKO
MAXIMIZIN
G JO
B BENEFITS ON-LINE
BARUCH AWERBUCH, YOSSI AZAR AND ODED REGEV
VARIABL
E LENGT
H SEQUENCING WIT
H TWO LENGTH
S
PIOTR BERMAN AND JUNICHIRO FUKUYAMA
RANDOMIZE
D PAT
H COLORING ON BINAR
Y TREE
S
VINCENZO AULETTA, LOANNIS CARAGIANNIS, CHRISTOS KAKLAMANIS
PINO PERSIANO
WAVELENGH
T REROUTIN
G IN OPTICA
L NETWORKS
, OR TH
E VENETIA
N
ROUTIN
G PROBLE
M
ALBERTO CAPRARA, GIUSEPPE F. ITALIANO, G. MOHAN,
ALESSANDRO PANCONESI AND ARAVIND SRINIVASAN
GREED
Y APPROXIMATIO
N ALGORITHM
S FOR FINDING DENSE
COMPONENT
S I
N A GRAP
H
MOSES CHARIKAR
ONLIN
E REAL-TIM
E PREEMPTIV
E SCHEDULIN
G OF JOBS WIT
H
DEADLINE
S
BHASKAR DASGUPTA AND MICHAEL A. PALIS
VII
I
O
N TH
E RELATIV
E COMPLEXIT
Y OF APPROXIMAT
E COUNTIN
G PROBLEM
S 108
MARTIN DYER, LESLIE ANN GOLBERG, CATHERINE GREENHILL AND
MARK JERRURN
O
N TH
E HARDNES
S OF APPROXIMATIN
G NP WITNESSE
S 120
URIEL FEIGE, MICHAEL LANGBERG AND KOBBI NISSIM
MAXIMU
M DISPERSIO
N AN
D GEOMETRI
C MAXIMU
M WEIGHT CLIQUES 132
SDNDOR P. FEKETE AND HENK MEIJER
NEW RESULT
S FOR ONLINE PAG
E REPLICATIO
N 144
RUDOLF FLEISCHER AND STEVE SEIDEN
INAPPROXIMABILIT
Y RESULT
S FOR SET SPLITTIN
G AN
D SATISFIABILIT
Y 155
PROBLEM
S WIT
H NO MIXED CLAUSES
VENKATESAN GURUSWAMI
APPROXIMATIO
N ALGORITHM
S FOR A CAPACITATE
D NETWOR
K DESIG
N 167
PROBLE
M
R. HASSIN, R. RAVI AND F.S. SALMAN
AN APPROXIMATIO
N ALGORITH
M FOR TH
E FAULT TOLERAN
T METRI
C FACILITY 177
LOCATIO
N PROBLE
M
KAMAL JAIN AND VIJAY V. VAZIRANI
IMPROVE
D APPROXIMATION
S FOR TOU
R AN
D TRE
E COVERS 184
JOCHEN KOENEMANN, GORAN KONJEVOD, OJAS PAREKH AND AMITABH SINHA
APPROXIMATIN
G NOD
E CONNECTIVITY PROBLEM
S VI
A SE
T COVERS 194
GUY KORTSARZ AND ZEEV NUTOV
RECTANGL
E TILIN
G 206
KRZYSZTOF LORYS AND KATARZYNA PALUCH
PRIMAL-DUA
L APPROACHE
S T
O TH
E STEINE
R PROBLE
M 214
TOBIAS POLZIN AND SIAVASH VAHDATI DANESHMAND
O
N TH
E INAPPROXIMABILIT
Y OF BROADCASTIN
G TIM
E
CHRISTIAN SCHINDELHAUER
226
IX
POLYNOMIA
L TIM
E APPROXIMATIO
N SCHEMES FOR CLASS-CONSTRAINE
D 238
PACKIN
G PROBLE
M
HADAS SHACHNAI AND TAMI TAMIR
PARTIA
L SERVICING OF ON-LINE JOBS 250
ROB VAN STEE AND HAN LA POUTRE
FACTO
R 4/
3 APPROXIMATION
S FOR MINIMU
M 2-CONNECTE
D SUBGRAPH
S 262
SANTOSH VEMPALA AND ADRIAN VETTA
AUTHO
R INDE
X
275 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV013309032 |
| 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 | SK 890 |
| classification_tum | MAT 913f MAT 410f |
| ctrlnum | (OCoLC)44811692 (DE-599)BVBBV013309032 |
| dewey-full | 004/.01/5114 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.01/5114 |
| dewey-search | 004/.01/5114 |
| dewey-sort | 14 11 45114 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV013309032</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041115</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">000815s2000 gw |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">959534547</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540679960</subfield><subfield code="9">3-540-67996-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)44811692</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013309032</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">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</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">004/.01/5114</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</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">MAT 410f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms for combinatorial optimization</subfield><subfield code="b">third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings</subfield><subfield code="c">Klaus Jansen ; Samir Khuller (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 273 S.</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">1913</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos e estruturas de dados</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation, Théorie de l' - Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation, Théorie de l' - Informatique - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Aproximacao (analise numerica)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Benaderingen (wiskunde)</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorische meetkunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matematica da computacao</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numerieke methoden</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimaliseren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimisation combinatoire - Informatique - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation combinatoire - Informatique - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme approximation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">approximation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système aléatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield><subfield code="x">Data processing</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield><subfield code="x">Data processing</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2000</subfield><subfield code="z">Saarbrücken</subfield><subfield code="2">gnd-content</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">Approximation</subfield><subfield code="0">(DE-588)4002498-2</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">Jansen, Klaus</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">APPROX</subfield><subfield code="n">3</subfield><subfield code="d">2000</subfield><subfield code="c">Saarbrücken</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10006814-5</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">1913</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1913</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009074572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009074572</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2000 Saarbrücken gnd-content |
| genre_facet | Konferenzschrift 2000 Saarbrücken |
| id | DE-604.BV013309032 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:06:59Z |
| institution | BVB |
| institution_GND | (DE-588)10006814-5 |
| isbn | 3540679960 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009074572 |
| oclc_num | 44811692 |
| open_access_boolean | |
| owner | DE-384 DE-91G DE-BY-TUM DE-739 DE-703 DE-824 DE-706 DE-83 DE-188 |
| owner_facet | DE-384 DE-91G DE-BY-TUM DE-739 DE-703 DE-824 DE-706 DE-83 DE-188 |
| physical | IX, 273 S. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings Klaus Jansen ; Samir Khuller (ed.) Berlin [u.a.] Springer 2000 IX, 273 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1913 Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Algoritmos e estruturas de dados larpcal Approximation, Théorie de l' - Informatique - Congrès Approximation, Théorie de l' - Informatique - Congrès ram Aproximacao (analise numerica) larpcal Benaderingen (wiskunde) gtt Combinatorische meetkunde gtt Matematica da computacao larpcal Numerieke methoden gtt Optimaliseren gtt Optimisation combinatoire - Informatique - Congrès Optimisation combinatoire - Informatique - Congrès ram algorithme approximation inriac approximation inriac complexité inriac graphe inriac optimisation combinatoire inriac système aléatoire inriac Datenverarbeitung Approximation theory Data processing Congresses Combinatorial optimization Data processing Congresses Computer algorithms Congresses Approximation (DE-588)4002498-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2000 Saarbrücken gnd-content Kombinatorische Optimierung (DE-588)4031826-6 s Approximation (DE-588)4002498-2 s DE-604 Jansen, Klaus Sonstige oth APPROX 3 2000 Saarbrücken Sonstige (DE-588)10006814-5 oth Lecture notes in computer science 1913 (DE-604)BV000000607 1913 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009074572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings Lecture notes in computer science Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Algoritmos e estruturas de dados larpcal Approximation, Théorie de l' - Informatique - Congrès Approximation, Théorie de l' - Informatique - Congrès ram Aproximacao (analise numerica) larpcal Benaderingen (wiskunde) gtt Combinatorische meetkunde gtt Matematica da computacao larpcal Numerieke methoden gtt Optimaliseren gtt Optimisation combinatoire - Informatique - Congrès Optimisation combinatoire - Informatique - Congrès ram algorithme approximation inriac approximation inriac complexité inriac graphe inriac optimisation combinatoire inriac système aléatoire inriac Datenverarbeitung Approximation theory Data processing Congresses Combinatorial optimization Data processing Congresses Computer algorithms Congresses Approximation (DE-588)4002498-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd |
| subject_GND | (DE-588)4002498-2 (DE-588)4031826-6 (DE-588)1071861417 |
| title | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings |
| title_auth | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings |
| title_exact_search | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings |
| title_full | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings Klaus Jansen ; Samir Khuller (ed.) |
| title_fullStr | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings Klaus Jansen ; Samir Khuller (ed.) |
| title_full_unstemmed | Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings Klaus Jansen ; Samir Khuller (ed.) |
| title_short | Approximation algorithms for combinatorial optimization |
| title_sort | approximation algorithms for combinatorial optimization third international workshop approx 2000 saarbrucken germany september 5 8 2000 proceedings |
| title_sub | third international workshop, APPROX 2000, Saarbrücken, Germany, September 5 - 8, 2000 ; proceedings |
| topic | Algorithmes - Congrès Algorithmes - Congrès ram Algoritmen gtt Algoritmos e estruturas de dados larpcal Approximation, Théorie de l' - Informatique - Congrès Approximation, Théorie de l' - Informatique - Congrès ram Aproximacao (analise numerica) larpcal Benaderingen (wiskunde) gtt Combinatorische meetkunde gtt Matematica da computacao larpcal Numerieke methoden gtt Optimaliseren gtt Optimisation combinatoire - Informatique - Congrès Optimisation combinatoire - Informatique - Congrès ram algorithme approximation inriac approximation inriac complexité inriac graphe inriac optimisation combinatoire inriac système aléatoire inriac Datenverarbeitung Approximation theory Data processing Congresses Combinatorial optimization Data processing Congresses Computer algorithms Congresses Approximation (DE-588)4002498-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd |
| topic_facet | Algorithmes - Congrès Algoritmen Algoritmos e estruturas de dados Approximation, Théorie de l' - Informatique - Congrès Aproximacao (analise numerica) Benaderingen (wiskunde) Combinatorische meetkunde Matematica da computacao Numerieke methoden Optimaliseren Optimisation combinatoire - Informatique - Congrès algorithme approximation approximation complexité graphe optimisation combinatoire système aléatoire Datenverarbeitung Approximation theory Data processing Congresses Combinatorial optimization Data processing Congresses Computer algorithms Congresses Approximation Kombinatorische Optimierung Konferenzschrift 2000 Saarbrücken |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009074572&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT jansenklaus approximationalgorithmsforcombinatorialoptimizationthirdinternationalworkshopapprox2000saarbruckengermanyseptember582000proceedings AT approxsaarbrucken approximationalgorithmsforcombinatorialoptimizationthirdinternationalworkshopapprox2000saarbruckengermanyseptember582000proceedings |