[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-326883-105":59,"doc-detail-326883-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","algorithm-theory-swat-2002-proceedings-lncs-2368","Algorithm Theory-SWAT 2002 - Proceedings (LNCS 2368)","","Algorithm Theory-SWAT 2002 proceedings from LNCS 2368 compile invited and contributed research presentations covering core areas in algorithms and their applications. The table of contents organizes papers by thematic tracks including ordering and dispatching, scheduling and approximation, computational geometry, exact and approximation methods in graph and base-station placement, as well as graph algorithms, dominating sets, and dynamic connectivity. The volume emphasizes algorithm design, complexity, approximation schemes, and efficient computational methods across multiple problem classes.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/algorithm-theory-swat-2002-proceedings-lncs-2368/326883/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/algorithm-theory-swat-2002-proceedings-lncs-2368/326883.png","ImageObject",300,407,{"name":92,"@type":93},"Rowan","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-22","2026-09-21",true,{"@type":102,"interactionType":103,"userInteractionCount":44},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What conference and series is this volume associated with?","Question",{"text":112,"@type":113},"The document is the Algorithm Theory-SWAT 2002 proceedings, published as Lecture Notes in Computer Science with the LNCS identifier 2368.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How is the content structured in the table of contents?",{"text":117,"@type":113},"It lists invited speakers first, then groups papers by algorithmic themes such as scheduling, computational geometry, and graph algorithms.",{"name":119,"@type":110,"acceptedAnswer":120},"What kinds of research topics are included?",{"text":121,"@type":113},"The volume covers algorithm design and analysis, including approximation schemes, scheduling methods, computational geometry techniques, and graph problems such as dominating sets and dynamic connectivity.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},326883,1790176321,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":44,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":4},1099514067415,"https://ap-avatar.wpscdn.com/avatar/100002539d78ffe74a7?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779092875211072502","Springer LINK: Lecture Notes in Computer Science  \nM. Penttonen, E. Meineche Schmidt (Eds.):  \nAlgorithm Theory-SWAT 2002  \n8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002. Proceedings  \nLNCS 2368  \nOrdering Information  \nTable of Contents  \nTitle pages in PDF (9 KB)  \nIn Memory of Timo Raita in PDF (14 KB) Preface in PDF (15 KB)  \nOrganization in PDF (20 KB)  \nTable of Contents in PDF (45 KB)  \nInvited Speakers  \nAn Efficient Quasidictionary  \nTorben Hagerup and Rajeev Raman LNCS 2368, p. 1 ff.  \nAbstract | Full article in PDF (217 KB)  \n[http://buffy.lib.unimelb.edu.au:2150/l](http://buffy.lib.unimelb.edu.au:2150/l)ink/service/series/0558/tocs/t2368 . htm (1 of 7) [9/30/2002 10:21:43 PM]  \nSpringer LINK: Lecture Notes in Computer Science  \nCombining Pattern Discovery and Probabilistic Modeling in Data Mining  \nHeikki Mannila LNCS 2368, p. 19  \nAbstract | Full article in PDF (33 KB)  \nScheduling  \nTime and Space Efficient Multi-method Dispatching  \nStephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe LNCS 2368, p. 20 ff.  \nAbstract | Full article in PDF (160 KB)  \nLinear Time Approximation Schemes for Vehicle Scheduling  \nJohn E. Augustine and Steven S. Seiden LNCS 2368, p. 30 ff.  \nAbstract | Full article in PDF (160 KB)  \nMinimizing Makespan for the Lazy Bureaucrat Problem  \nClint Hepner and Cliff Stein LNCS 2368, p. 40 ff.  \nAbstract | Full article in PDF (149 KB)  \nA PTAS for the Single Machine Scheduling Problem with Controllable Processing Times  \nMonaldo Mastrolilli  \nLNCS 2368, p. 51 ff.  \nAbstract | Full article in PDF (154 KB)  \nComputational Geometry  \nOptimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains  \nStephan Eidenbenz  \nLNCS 2368, p. 60 ff.  \nAbstract | Full article in PDF (138 KB)  \nSimplex Range Searching and  Nearest Neighbors of a Line Segment in 2D  \nPartha P. Goswami, Sandip Das, and Subhas C. Nandy LNCS 2368, p. 69 ff.  \nAbstract | Full article in PDF (208 KB)  \nAdaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains  \nChristos Levcopoulos, Andrzej Lingas, and Joseph S.B. Mitchell LNCS 2368, p. 80 ff.  \nAbstract | Full article in PDF (149 KB)  \n[http://buffy.lib.unimelb.edu.au:2150/l](http://buffy.lib.unimelb.edu.au:2150/l)ink/service/series/0558/tocs/t2368 . htm (2 of 7) [9/30/2002 10:21:43 PM]  \nSpringer LINK: Lecture Notes in Computer Science  \nExact Algorithms and Approximation Schemes for Base Station Placement Problems  \nNissan Lev-Tov and David Peleg LNCS 2368, p. 90 ff.  \nAbstract | Full article in PDF (174 KB)  \nA Factor-2 Approximation for Labeling Points with Maximum Sliding Labels  \nZhongping Qin and Binhai Zhu LNCS 2368, p. 100 ff.  \nAbstract | Full article in PDF (153 KB)  \nOptimal Algorithm for a Special Point-Labeling Problem  \nSasanka Roy, Partha P. Goswami, Sandip Das, and Subhas C. Nandy LNCS 2368, p. 110 ff.  \nAbstract | Full article in PDF (171 KB)  \nRandom Arc Allocation and Applications  \nPeter Sanders and Berthold Vöcking LNCS 2368, p. 121 ff.  \nAbstract | Full article in PDF (159 KB)  \nOn Neighbors in Geometric Permutations  \nMicha Sharir and Shakhar Smorodinsky LNCS 2368, p. 131 ff.  \nAbstract | Full article in PDF (152 KB)  \nGraph Algorithms  \nPowers of Geometric Intersection Graphs and Dispersion Algorithms  \nGeir Agnarsson, Peter Damaschke, and Magnús M. Halldórsson LNCS 2368, p. 140 ff.  \nAbstract | Full article in PDF (179 KB)  \nEfficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case  \nJochen Alber, Michael R. Fellows, and Rolf Niedermeier LNCS 2368, p. 150 ff.  \nAbstract | Full article in PDF (242 KB)  \nPlanar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous  \nHajo Broersma, Fedor V. Fomin, Jan Kratochvíl, and Gerhard J. Woeginger LNCS 2368, p. 160 ff.  \nAbstract | Full article in PDF (158 KB)  \nApproximation Hardness of the Steiner Tree Problem on Graphs  \nMiroslav Chlebík and Janka Chlebí","cbCailRpgaJU1Q1G","https://ap.wps.com/l/cbCailRpgaJU1Q1G","pdf",5223338,455,"English","# Invited Speakers\n## An Efficient Quasidictionary\n# Ordering and Scheduling\n## Combining Pattern Discovery and Probabilistic Modeling in Data Mining\n## Time and Space Efficient Multi-method Dispatching\n## Linear Time Approximation Schemes for Vehicle Scheduling\n## Minimizing Makespan for the Lazy Bureaucrat Problem\n## A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times\n# Computational Geometry\n## Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains\n## Simplex Range Searching and Nearest Neighbors of a Line Segment in 2D\n## Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains\n# Graph Algorithms\n## Exact Algorithms and Approximation Schemes for Base Station Placement Problems\n## Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case\n## Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous\n## Approximation Hardness of the Steiner Tree Problem on Graphs","[{\"question\":\"What conference and series is this volume associated with?\",\"answer\":\"The document is the Algorithm Theory-SWAT 2002 proceedings, published as Lecture Notes in Computer Science with the LNCS identifier 2368.\"},{\"question\":\"How is the content structured in the table of contents?\",\"answer\":\"It lists invited speakers first, then groups papers by algorithmic themes such as scheduling, computational geometry, and graph algorithms.\"},{\"question\":\"What kinds of research topics are included?\",\"answer\":\"The volume covers algorithm design and analysis, including approximation schemes, scheduling methods, computational geometry techniques, and graph problems such as dominating sets and dynamic connectivity.\"}]","Algorithm Theory-SWAT 2002 - Proceedings (LNCS 2368) | PDF",1789975648,1147]