Algorithms - ESA 2007 (Record no. 93660)

000 -LEADER
fixed length control field 06711nam a22006375i 4500
001 - CONTROL NUMBER
control field 978-3-540-75520-3
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730191210.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100301s2007 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540755203
-- 978-3-540-75520-3
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-540-75520-3
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.758
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051230
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms - ESA 2007
Medium [electronic resource] :
Remainder of title 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings /
Statement of responsibility, etc. edited by Lars Arge, Michael Hoffmann, Emo Welzl.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2007.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Berlin, Heidelberg :
Name of producer, publisher, distributor, manufacturer Springer Berlin Heidelberg :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2007.
300 ## - PHYSICAL DESCRIPTION
Extent XV, 772 p.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 4698
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Lectures -- Nash Equilibria: Where We Stand -- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation -- Arrangements in Geometry: Recent Advances and Challenges -- Contributed Papers: Design and Analysis Track -- Nash Equilibria in Voronoi Games on Graphs -- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation -- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks -- Finding Frequent Elements in Non-bursty Streams -- Tradeoffs and Average-Case Equilibria in Selfish Routing -- On the Variance of Subset Sum Estimation -- On Minimum Power Connectivity Problems -- On the Cost of Interchange Rearrangement in Strings -- Finding Mobile Data: Efficiency vs. Location Inaccuracy -- A Faster Query Algorithm for the Text Fingerprinting Problem -- Polynomial Time Algorithms for Minimum Energy Scheduling -- k-Mismatch with Don't Cares -- Finding Branch-Decompositions and Rank-Decompositions -- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover -- Linear-Time Ranking of Permutations -- Radix Sorting with No Extra Space -- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation -- Order Statistics in the Farey Sequences in Sublinear Time -- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks -- Dial a Ride from k-Forest -- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue -- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication -- Optimal Algorithms for k-Search with Application in Option Pricing -- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra -- Stackelberg Strategies for Atomic Congestion Games -- Good Quality VirtualRealization of Unit Ball Graphs -- Algorithms for Playing Games with Limited Randomness -- Approximation of Partial Capacitated Vertex Cover -- Optimal Resilient Dynamic Dictionaries -- Determining the Smallest k Such That G Is k-Outerplanar -- On the Size of Succinct Indices -- Compact Oracles for Approximate Distances Around Obstacles in the Plane -- Convex Combinations of Single Source Unsplittable Flows -- Farthest-Polygon Voronoi Diagrams -- Equitable Revisited -- Online Scheduling of Equal-Length Jobs on Parallel Machines -- k-Anonymization with Minimal Loss of Information -- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs -- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling -- Bundle Pricing with Comparable Items -- Approximating Interval Scheduling Problems with Bounded Profits -- Pricing Tree Access Networks with Connected Backbones -- Distance Coloring -- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching -- To Fill or Not to Fill: The Gas Station Problem -- Online Bandwidth Allocation -- Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems -- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems -- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs -- Dynamic Plane Transitive Closure -- Contributed Papers: Engineering and Applications Track -- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments -- Estimating Clustering Indexes in Data Streams -- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics -- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step -- Fast and Compact Oracles for Approximate Distances in Planar Graphs -- Exact Minkowksi Sumsof Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces -- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks -- Algorithms to Separate -Chvátal-Gomory Cuts -- Fast Lowest Common Ancestor Computations in Dags -- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem -- Solutions to Real-World Instances of PSPACE-Complete Stacking -- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough -- An Experimental Study of New and Known Online Packet Buffering Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Software engineering.
9 (RLIN) 4138
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Numerical analysis.
9 (RLIN) 4603
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics.
9 (RLIN) 12873
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence
General subdivision Data processing.
9 (RLIN) 21787
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer networks .
9 (RLIN) 31572
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Software Engineering.
9 (RLIN) 4138
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Numerical Analysis.
9 (RLIN) 4603
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete Mathematics in Computer Science.
9 (RLIN) 31837
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data Science.
9 (RLIN) 34092
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Communication Networks.
9 (RLIN) 145509
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Arge, Lars.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 145510
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hoffmann, Michael.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 145511
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Welzl, Emo.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 145512
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 145513
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783540755197
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783540844778
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume/sequential designation 4698
9 (RLIN) 145514
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-540-75520-3">https://doi.org/10.1007/978-3-540-75520-3</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.