Algorithm Theory - SWAT 2002
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithm Theory - SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings(2368 Lecture Notes in Computer Science)
Algorithm Theory - SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings(2368 Lecture Notes in Computer Science)

Algorithm Theory - SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings(2368 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

ThepapersinthisvolumewerepresentedatSWAT2002,theEighthScandi- vianWorkshoponAlgorithmTheory. Theworkshop,whichisreallyaconference, hasbeenheldbienniallysince1988,rotatingbetweenthe?veNordiccountries (Denmark,Finland,Iceland,Norway,andSweden). Italsohasalooseassoc- tionwiththeWADS(WorkshoponAlgorithmsandDataStructures)conference thatisheldinoddnumberedyears. SWATisintendedasaforumforrese- chersintheareaofdesignandanalysisofalgorithms. TheSWATconferences arecoordinatedbytheSWATsteeringcommittee,whichconsistsofB. Aspvall (Bergen),S. Carlsson(Lule? a),H. Hafsteinsson(Iceland),R. Karlsson(Lund), ? A. Lingas(Lund),E. M. Schmidt(Arhus),andE. Ukkonen(Helsinki). Thecallforpaperssoughtcontributionsinallareasofalgorithmsanddata structures,includingcomputationalgeometry,parallelanddistributedcom- ting, graph theory, computational biology, and combinatorics. A total of 103 papers were submitted, out of which the program committee selected 43 for presentation. In addition, invited lectures were presented by Torben Hagerup (Frankfurt)andHeikkiMannila(Helsinki). SWAT2002washeldinTurku,July3-5,2002,andwaslocallyorganizedbya committeeconsistingofT. J..arvi(chair),L. Bergroth,T. Kaukoranta,T. Raita, J. Smed,andJ. Teuhola(secr. ),allfromtheDepartmentofComputerScience, UniversityofTurku. Wewishtothankalltherefereeswhoaidedinevaluatingthepapers. Wealso thanktheAcademyofFinland,TurkuCentreforComputerScience(TUCS), andTurkuUniversityFoundationfor?nancialsupport. July2002 MarttiPenttonen ErikMeinecheSchmidt Organization SWAT2002wasorganizedbytheDepartmentofComputerScience,University ofTurku. ProgramCommittee MarttiPenttonen,UniversityofKuopio(co-chair) ? ErikMeinecheSchmidt,Universityof Arhus(co-chair) MicahAdler,UniversityofMassachusetts MartinDietzfelbinger,TechnischeUniversit..atIlmenau PinarHeggernes,UniversityofBergen GiuseppeF. Italiano,UniversityofRome HaimKaplan,TelAvivUniversity RolfKarlsson,UniversityofLund JyrkiKatajainen,UniversityofCopenhagen OlliNevalainen,UniversityofTurku JopSibeyn,UniversityofUme? a MichielSmid,CarletonUniversity Referees IstoAho RolfFagerberg ChristosLevcopoulos TeroAittokallio JiriFiala MosheLewenstein LyudmilAleksandrov JarlFriis AndrzejLingas StephenAlstrup LeszekG,asieniec Eva-MartaLundell MattiasAndersson JordanGergov BengtNilsson EstieArkin HectorGonzalez-Banos JyrkiNummenmaa LasseBergroth HenrikGrove JeppeNejsumMadsen AnneBerry JoachimGudmundsson FredrikManne PhilipBille IngeLiGortz UlrichMeyer HolgerBlaar MikaelHammar PeterBroMiltersen JeanBlair IiroHonkala MichaelMinock JormaBoberg HeikkiHyyr. .o PatMorin JesperBojesen ChristianIcking ErkkiM..akinen GerthS. Brodal TiborJordan RasmusPagh WentongCai DavidGroveJorgensen TomiPasanen JianerChen JarkkoKari ChristianN. S. Pedersen ArturCzumaj MichaelKaufmann MortenNicolajPedersen CamilDemetrescu TimoKnuutila MiaPersson AndersDessmark PetterKristiansen ElyPorat FrankDrewes ElmarLangetepe AndrzejProskurowski X Organization YuvalRabani MikkelSigurd JanArneTelle PrabhakarRagde SteveSkiena JukkaTeuhola JagathRajapakse SorenSkov J. Urrutia TheisRauhe ChristianSloper PawelWinter FrederikRonn RobertoSolis-Oba LarsYde PeterSanders Hans-HenrikStaerfeldt MartinZachariasen PetraSche?er KokichiSugihara RodedSharan ArieTamir TableofContents InvitedSpeakers AnE?cientQuasidictionary...1 Torben Hagerup, Rajeev Raman CombiningPatternDiscoveryandProbabilisticModelinginData Mining...19 Heikki Mannila Scheduling TimeandSpaceE?cientMulti-methodDispatching ...20 Stephen Alstrup, Gerth Stolting Brodal, Inge Li Gortz, Theis Rauhe LinearTimeApproximationSchemesforVehicleScheduling...30 John E. Augustine, Steven S. Seiden MinimizingMakespanfortheLazyBureaucratProblem...40 Clint Hepner, Cli? Stein APTASfortheSingleMachineSchedulingProblemwith ControllableProcessingTimes...51 Monaldo Mastrolilli ComputationalGeometry OptimumInapproximabilityResultsforFindingMinimumHidden GuardSetsinPolygonsandTerrains...60 Stephan Eidenbenz SimplexRangeSearchingandkNearestNeighborsofaLine Segmentin2D ...69 Partha P. Goswami, Sandip Das, Subhas C.

Table of Contents:
Invited Speakers.- An Efficient Quasidictionary.- Combining Pattern Discovery and Probabilistic Modeling in Data Mining.- Scheduling.- Time and Space Efficient Multi-method Dispatching.- Linear Time Approximation Schemes for Vehicle Scheduling.- Minimizing Makespan for the Lazy Bureaucrat Problem.- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times.- Computational Geometry.- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.- Exact Algorithms and Approximation Schemes for Base Station Placement Problems.- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.- Optimal Algorithm for a Special Point-Labeling Problem.- Random Arc Allocation and Applications.- On Neighbors in Geometric Permutations.- Graph Algorithms.- Powers of Geometric Intersection Graphs and Dispersion Algorithms.- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case.- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.- Approximation Hardness of the Steiner Tree Problem on Graphs.- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms.- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.- Approximation Algorithms for Edge-Dilation k-Center Problems.- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm.- Improved Algorithms for the Random Cluster Graph Model.-?-List Vertex Coloring in Linear Time.- Robotics.- Robot Localization without Depth Perception.- Online Parallel Heuristics and Robot Searching under the Competitive Framework.- Analysis of Heuristics for the Freeze-Tag Problem.- Approximation Algorithms.- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.- All-Norm Approximation Algorithms.- Approximability of Dense Instances of Nearest Codeword Problem.- Data Communication.- Call Control with k Rejections.- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.- Packet Bundling.- Algorithms for the Multi-constrained Routing Problem.- Computational Biology.- Computing the Threshold for q-Gram Filters.- On the Generality of Phylogenies from Incomplete Directed Characters.- Data Storage and Manipulation.- Sorting with a Forklift.- Tree Decompositions with Small Cost.- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition.- Performance Tuning an Algorithm for Compressing Relational Tables.- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset.- Paging on a RAM with Limited Resources.- An Optimal Algorithm for Finding NCA on Pure Pointer Machines.- Amortized Complexity of Bulk Updates in AVL-Trees.


Best Sellers


Product Details
  • ISBN-13: 9783540438663
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 452
  • Returnable: N
  • Sub Title: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings
  • ISBN-10: 3540438661
  • Publisher Date: 19 Jun 2002
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2368 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithm Theory - SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings(2368 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithm Theory - SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings(2368 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithm Theory - SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings(2368 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!