Return to home page
Searching: Otterbein library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.

LEADER 00000cam  2200697Ii 4500 
001    882247905 
003    OCoLC 
005    20181116042259.8 
006    m     o  d         
007    cr ||||||||||| 
008    140701s2014    sz a    o     101 0 eng d 
019    885338308|a964875251|a1005770209|a1027515700 
020    9783319084046|q(electronic bk.) 
020    3319084046|q(electronic bk.) 
020    |z9783319084039|q(print) 
020    |z3319084038|q(print) 
024 7  10.1007/978-3-319-08404-6|2doi 
035    (OCoLC)882247905|z(OCoLC)885338308|z(OCoLC)964875251
       |z(OCoLC)1005770209|z(OCoLC)1027515700 
040    NLGGC|beng|erda|epn|cNLGGC|dOCLCO|dGW5XE|dCOO|dYDXCP|dUPM
       |dOCLCF|dOHI|dOCLCO|dOCL|dOCLCO|dEBLCP|dDIBIB|dOCLCO|dVT2
       |dJG0|dOCLCQ|dESU|dOCLCQ|dNJR|dMERUC|dBUF|dKIJ|dVMW|dOCLCQ
       |dIOG|dCEF|dDEHBZ|dOCLCQ|dU3W|dAU@|dOCLCQ|dWYU 
049    MAIN 
050  4 QA76.9.A43 
072  7 UMB|2bicssc 
072  7 COM051300|2bisacsh 
082 04 005.1|223 
111 2  Scandinavian Workshop on Algorithm Theory|0http://
       id.loc.gov/authorities/names/n90653898|n(14th :|d2014 :
       |cCopenhagen, Denmark) 
245 10 Algorithm theory-- SWAT 2014 :|b14th Scandinavian 
       Symposium and Workshops, Copenhagen, Denmark, July 2-4, 
       2014 : proceedings /|cR. Ravi, Inge Li Grtz (Eds.). 
246 3  SWAT 2014 
264  1 Cham :|bSpringer,|c[2014] 
264  4 |c2014 
300    1 online resource. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
347    text file|2rdaft|0http://rdaregistry.info/termList/
       fileType/1002 
490 1  Lecture Notes in Computer Science,|x0302-9743 ;|v8503 
490 1  LNCS sublibrary. SL 1, Theoretical computer science and 
       general issues 
500    International conference proceedings. 
500    Includes author index. 
505 0  Online Makespan Minimization with Parallel Schedules -- 
       Expected Linear Time Sorting for Word Size [Omega](log2 n 
       log log n) -- Amortized Analysis of Smooth Quadtrees in 
       All Dimensions -- New Approximability Results for the 
       Robust k-Median Problem -- Approximating the Revenue 
       Maximization Problem with Sharp Demands -- Reconfiguring 
       Independent Sets in Claw-Free Graphs -- Competitive Online
       Routing on Delaunay Triangulations -- Optimal Planar 
       Orthogonal Skyline Counting Queries -- B-slack Trees: 
       Space Efficient B-Trees -- Approximately Minwise 
       Independence with Twisted Tabulation -- Colorful Bin 
       Packing -- Algorithms Parameterized by Vertex Cover and 
       Modular Width, through Potential Maximal Cliques -- Win-
       Win Kernelization for Degree Sequence Completion Problems 
       -- On Matchings and b-Edge Dominating Sets: A 2-
       Approximation Algorithm for the 3-Edge Dominating Set 
       Problem -- Covering Problems in Edge- and Node-Weighted 
       Graphs -- Colored Range Searching in Linear Space -- Fast 
       Dynamic Graph Algorithms for Parameterized Problems -- 
       Extending Partial Representations of Proper and Unit 
       Interval Graphs -- Minimum Tree Supports for Hypergraphs 
       and Low-Concurrency Euler Diagrams -- Approximate Counting
       of Matchings in (3,3)-Hypergraphs. 
520    This book constitutes the refereed proceedings of the 14th
       International Scandinavian Symposium and Workshops on 
       Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, 
       in July 2014. The 33 papers were carefully reviewed and 
       selected from a total of 134 submissions. The papers 
       present original research and cover a wide range of topics
       in the field of design and analysis of algorithms and data
       structures including but not limited to approximation 
       algorithms, parameterized algorithms, computational 
       biology, computational geometry and topology, distributed 
       algorithms, external-memory algorithms, exponential 
       algorithms, graph algorithms, online algorithms, 
       optimization algorithms, randomized algorithms, streaming 
       algorithms, string algorithms, sublinear algorithms, and 
       algorithmic game theory. 
588 0  Online resource; title from PDF title page (SpringerLink, 
       viewed July 7, 2014). 
650  0 Computer algorithms|vCongresses.|0http://id.loc.gov/
       authorities/subjects/sh2008101223 
650  0 Data structures (Computer science)|vCongresses.|0http://
       id.loc.gov/authorities/subjects/sh2009122874 
650  4 Engineering & Applied Sciences. 
650  4 Computer Science. 
655  4 Electronic books. 
655  4 Ebook. 
655  7 Conference papers and proceedings.|2fast|0http://
       id.worldcat.org/fast/1423772 
655  7 Conference papers and proceedings.|2lcgft|0http://
       id.loc.gov/authorities/genreForms/gf2014026068 
700 1  Ravi, R.|q(Ramamoorthi),|d1969-|0http://id.loc.gov/
       authorities/names/n00003544|eeditor. 
700 1  Grtz, Inge Li,|eeditor. 
776 08 |iPrinted edition:|z9783319084039 
830  0 Lecture notes in computer science ;|0http://id.loc.gov/
       authorities/names/n42015162|v8503.|x1611-3349 
830  0 LNCS sublibrary.|nSL 1,|pTheoretical computer science and 
       general issues.|0http://id.loc.gov/authorities/names/
       no2007042902 
880 0  |6505-00/(S|aOnline Makespan Minimization with Parallel 
       Schedules -- Expected Linear Time Sorting for Word Size 
       Ω(log2 n log log n) -- Amortized Analysis of Smooth 
       Quadtrees in All Dimensions -- New Approximability Results
       for the Robust k-Median Problem -- Approximating the 
       Revenue Maximization Problem with Sharp Demands -- 
       Reconfiguring Independent Sets in Claw-Free Graphs -- 
       Competitive Online Routing on Delaunay Triangulations -- 
       Optimal Planar Orthogonal Skyline Counting Queries -- B-
       slack Trees: Space Efficient B-Trees -- Approximately 
       Minwise Independence with Twisted Tabulation -- Colorful 
       Bin Packing -- Algorithms Parameterized by Vertex Cover 
       and Modular Width, through Potential Maximal Cliques -- 
       Win-Win Kernelization for Degree Sequence Completion 
       Problems -- On Matchings and b-Edge Dominating Sets: A 2-
       Approximation Algorithm for the 3-Edge Dominating Set 
       Problem -- Covering Problems in Edge- and Node-Weighted 
       Graphs -- Colored Range Searching in Linear Space -- Fast 
       Dynamic Graph Algorithms for Parameterized Problems -- 
       Extending Partial Representations of Proper and Unit 
       Interval Graphs -- Minimum Tree Supports for Hypergraphs 
       and Low-Concurrency Euler Diagrams -- Approximate Counting
       of Matchings in (3,3)-Hypergraphs. 
990    SpringerLink|bSpringer English/International eBooks 2014 -
       Full Set|c2018-11-16|yMaster record variable field(s) 
       change: 650|5OH1 
990    SpringerLink|bSpringer English/International eBooks 2014 -
       Full Set|c2018-10-31|yNew collection 
       springerlink.ebooks2014|5OH1 
LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team