Algorithm theory - SWAT 2010: 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings
Saved in:
| Format: | Conference Proceeding Book |
|---|---|
| Language: | English |
| Published: |
Berlin [u.a.]
Springer
2010
|
| Series: | Lecture Notes in Computer Science
6139 |
| Subjects: | |
| Online Access: | Inhaltstext Inhaltsverzeichnis |
| Physical Description: | XIII, 434 S. graph. Darst. |
| ISBN: | 9783642137303 364213730X |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV036513605 | ||
| 003 | DE-604 | ||
| 005 | 20100803 | ||
| 007 | t| | ||
| 008 | 100621s2010 xx d||| |||| 10||| eng d | ||
| 015 | |a 10,N21 |2 dnb | ||
| 016 | 7 | |a 1002541034 |2 DE-101 | |
| 020 | |a 9783642137303 |9 978-3-642-13730-3 | ||
| 020 | |a 364213730X |9 3-642-13730-X | ||
| 024 | 3 | |a 9783642137303 | |
| 028 | 5 | 2 | |a 80016176 |
| 035 | |a (OCoLC)699698782 | ||
| 035 | |a (DE-599)DNB1002541034 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-11 |a DE-91G |a DE-83 | ||
| 082 | 0 | |a 004.015118 |2 22/ger | |
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 455f |2 stub | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 530f |2 stub | ||
| 245 | 1 | 0 | |a Algorithm theory - SWAT 2010 |b 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings |c Haim Kaplan (ed.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2010 | |
| 300 | |a XIII, 434 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 6139 | |
| 650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2010 |z Bergen Norwegen |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Kaplan, Haim |e Sonstige |4 oth | |
| 711 | 2 | |a SWAT |n 12 |d 2010 |c Bergen |j Sonstige |0 (DE-588)16071240-3 |4 oth | |
| 830 | 0 | |a Lecture Notes in Computer Science |v 6139 |w (DE-604)BV000000607 |9 6139 | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3476864&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 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=020435763&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-020435763 | |
Record in the Search Index
| _version_ | 1820875235598008320 |
|---|---|
| adam_text |
TABLE OF CONTENTS OPTIMAL EXPLORATION OF TERRAINS WITH OBSTACLES 1 JUREK
CZYZOWICZ, DAVID ILCINKAS, ARNAUD LABOUREL, AND ANDRZEJ PELE
RECONSTRUCTING A SIMPLE POLYGON FROM ITS ANGLES 13 YANN DISSER, MATUS
MIHALAK, AND PETER WIDMAYER SEMIDEFINITE PROGRAMMING AND APPROXIMATION
ALGORITHMS: A SURVEY (INVITED TALK) 25 SANJEEV ARORA STRICTLY-REGULAR
NUMBER SYSTEM AND DATA STRUCTURES 26 AMR ELMASRY, CLAUS JENSEN, AND
JYRKI KATAJAINEN AN 0(LOG LOG ^-COMPETITIVE BINARY SEARCH TREE WITH
OPTIMAL WORST-CASE ACCESS TIMES 38 PROSENJIT BOSE, KARIM DOUIEB, VIDA
DUJMOVIC, AND ROLF FAGERBERG THE EMERGENCE OF SPARSE SPANNERS AND GREEDY
WELL-SEPARATED PAIR DECOMPOSITION 50 JIE GAO AND DENGPAN ZHOU A
BOTTOM-UP METHOD AND FAST ALGORITHMS FOR MAX INDEPENDENT SET 62 NICOLAS
BOURGEOIS, BRUNO ESCOFFIER, VANGELIS TH. PASCHOS, AND JOHAN M. M. VAN
ROOIJ CAPACITATED DOMINATION FASTER THAN O(2") 74 MAREK CYGAN, MARCIN
PILIPCZUK, AND JAKUB ONUFRY WOJTASZCZYK ISOMORPHISM FOR GRAPHS OF
BOUNDED FEEDBACK VERTEX SET NUMBER 81 STEFAN KRATSCH AND PASCAL
SCHWEITZER ON FEEDBACK VERTEX SET NEW MEASURE AND NEW STRUCTURES 93
YIXIN CAO, JIANER CHEN, AND YANG LIU CONFLICT-FREE COLORING MADE
STRONGER 105 ELAD BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/1002541034 DIGITALISIERT DURCH XII TABLE OF CONTENTS
MINIMUM AND MAXIMUM AGAINST FE LIES 139 MICHAEL HOFFMANN, JIRI MATOUSEK,
YOSHIO OKAMOTO, AND PHILIPP ZUMSTEIN FEASIBLE AND ACCURATE ALGORITHMS
FOR COVERING SEMIDEFINITE PROGRAMS 150 GARUD IYENGAR, DAVID J. PHILLIPS,
AND CLIFF STEIN THE QUANTITATIVE ANALYSIS OF USER BEHAVIOR ONLINE -
DATA, MODELS AND ALGORITHMS (INVITED TALK) 163 PRABHAKAR RAGHAVAN
SYSTEMS OF LINEAR EQUATIONS OVER F2 AND PROBLEMS PARAMETERIZED ABOVE
AVERAGE 164 ROBERT CROWSTON, GREGORY GUTIN, MARK JONES, EUN JUNG KIM,
AND IMRE Z. RUZSA CAPACITATED MAX-BATCHING WITH INTERVAL GRAPH
COMPATIBILITIES 176 TIM NONNER A WEAKLY ROBUST PTAS FOR MINIMUM CLIQUE
PARTITION IN UNIT DISK GRAPHS (EXTENDED ABSTRACT) 188 IMRAN A. PIRWANI
AND MOHAMMAD R. SALAVATIPOUR REPRESENTING A FUNCTIONAL CURVE BY CURVES
WITH FEWER PEAKS 200 DANNY Z. CHEN, CHAO WANG, AND HAITAO WANG BREGMAN
CLUSTERING FOR SEPARABLE INSTANCES 212 MARCEL R. ACKERMANN AND JOHANNES
BLOEMER IMPROVED METHODS FOR GENERATING QUASI-GRAY CODES 224 PROSENJIT
BOSE, PAZ CARMI, DANA JANSENS, ANIL MAHESHWARI, PAT MORIN, AND MICHIEL
SMID THE MST OF SYMMETRIE DISK GRAPHS IS LIGHT 236 A. KARIM ABU-AFFASH,
ROM ASCHNER, PAZ CARMI, AND MATTHEW J. KATZ VECTO TABLE OF CONTENTS XIII
APPROXIMATION ALGORITHMS FOR FREE-LABEL MAXIMIZATION 297 MARK DE BERG
AND DIRK H.P. GERRITS PHASE TRANSITIONS IN SAMPLING ALGORITHMS AND THE
UNDERLYING RANDOM STRUCTURES 309 DANA RANDALL POLYNOMIAL KERNELS FOR
HARD PROBLEMS ON DISK GRAPHS 310 BART JANSEN FASTER PARAMETERIZED
ALGORITHMS FOR MINOR CONTAINMENT 322 ISOLDE ADLER, FREDERIC DORN, FEDOR
V. FOMIN, IGNASI SAU, AND DIMITRIOS M. THILIKOS FIXED-PARAMETER
ALGORITHMS FOR COCHROMATIC NUMBER AND DISJOINT RECTANGLE STABBING 334
PINAR HEGGERNES, DIETER KRATSCH, DANIEL LOKSHTANOV, VENKATESH RAMAN, AND
SAKET SAURABH DISPATCHING EQUAL-LENGTH JOBS TO PARALLEL MACHINES TO
MAXIMIZE THROUGHPUT 346 DAVID P. BUNDE AND MICHAEL H. GOLDWASSER ONLINE
FUNCTION TRACKING WITH GENERALIZED PENALTIES 359 MARCIN BIENKOWSKI AND
STEFAN SCHMID BETTER BOUNDS ON ONLINE UNIT CLUSTERING 371 MARTIN R.
EHMSEN AND KIM S. LARSEN ONLINE SELECTION OF INTERVALS AND I-INTERVALS
383 UNNAR TH. BACHMANN, MAGNUS M. HALLDORSSON, AND HADAS SHACHNAI
APPROXIMATING THE MAXIMUM 3- AND 4-EDGE-COLORABLE SUBGRAPH (EXTENDED
ABSTRACT) 395 MARCIN KAMINSKI AND LUKASZ KOWALIK IMPROVED ALGORITHM FOR
DEGREE BOUNDED SURVIVABLE NETWORK DESIGN PROBLE |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV036513605 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 455f DAT 530f |
| ctrlnum | (OCoLC)699698782 (DE-599)DNB1002541034 |
| dewey-full | 004.015118 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015118 |
| dewey-search | 004.015118 |
| dewey-sort | 14.015118 |
| 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 a2200000 cb4500</leader><controlfield tag="001">BV036513605</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100803</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">100621s2010 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,N21</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1002541034</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642137303</subfield><subfield code="9">978-3-642-13730-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">364213730X</subfield><subfield code="9">3-642-13730-X</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642137303</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">80016176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699698782</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1002541034</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="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015118</subfield><subfield code="2">22/ger</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 455f</subfield><subfield code="2">stub</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">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm theory - SWAT 2010</subfield><subfield code="b">12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings</subfield><subfield code="c">Haim Kaplan (ed.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 434 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">6139</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">2010</subfield><subfield code="z">Bergen Norwegen</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kaplan, Haim</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">SWAT</subfield><subfield code="n">12</subfield><subfield code="d">2010</subfield><subfield code="c">Bergen</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16071240-3</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">6139</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6139</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=3476864&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=020435763&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-020435763</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2010 Bergen Norwegen gnd-content |
| genre_facet | Konferenzschrift 2010 Bergen Norwegen |
| id | DE-604.BV036513605 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:12:24Z |
| institution | BVB |
| institution_GND | (DE-588)16071240-3 |
| isbn | 9783642137303 364213730X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020435763 |
| oclc_num | 699698782 |
| open_access_boolean | |
| owner | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 |
| physical | XIII, 434 S. graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Springer |
| record_format | marc |
| series | Lecture Notes in Computer Science |
| series2 | Lecture Notes in Computer Science |
| spelling | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings Haim Kaplan (ed.) Berlin [u.a.] Springer 2010 XIII, 434 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture Notes in Computer Science 6139 Datenstruktur (DE-588)4011146-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2010 Bergen Norwegen gnd-content Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Kaplan, Haim Sonstige oth SWAT 12 2010 Bergen Sonstige (DE-588)16071240-3 oth Lecture Notes in Computer Science 6139 (DE-604)BV000000607 6139 text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3476864&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020435763&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings Lecture Notes in Computer Science Datenstruktur (DE-588)4011146-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4011146-5 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings |
| title_auth | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings |
| title_exact_search | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings |
| title_full | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings Haim Kaplan (ed.) |
| title_fullStr | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings Haim Kaplan (ed.) |
| title_full_unstemmed | Algorithm theory - SWAT 2010 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings Haim Kaplan (ed.) |
| title_short | Algorithm theory - SWAT 2010 |
| title_sort | algorithm theory swat 2010 12th scandinavian workshop on algorithm theory bergen norway june 21 23 2010 proceedings |
| title_sub | 12th scandinavian workshop on algorithm theory, Bergen, Norway, june 21-23, 2010 ; proceedings |
| topic | Datenstruktur (DE-588)4011146-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Datenstruktur Berechnungskomplexität Algorithmus Konferenzschrift 2010 Bergen Norwegen |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3476864&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020435763&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT kaplanhaim algorithmtheoryswat201012thscandinavianworkshoponalgorithmtheorybergennorwayjune21232010proceedings AT swatbergen algorithmtheoryswat201012thscandinavianworkshoponalgorithmtheorybergennorwayjune21232010proceedings |