Combinatorial Algorithms (Registro nro. 227950)

MARC details
000 -LIDER
fixed length control field 05057nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-319-44543-4
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20180206183142.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 160808s2016 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319445434
-- 978-3-319-44543-4
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.M35
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYAM
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM018000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT008000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Combinatorial Algorithms
Medium [recurso electrónico] :
Remainder of title 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings /
Statement of responsibility, etc. edited by Veli Mäkinen, Simon J. Puglisi, Leena Salmela.
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2016.
300 ## - PHYSICAL DESCRIPTION
Extent XX, 462 p. 100 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume/sequential designation 9843
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Computational complexity -- On the complexity of computing the tree-breadth.-Online Chromatic Number is PSPACE-Complete -- Computational geometry -- Bounded embeddings of graphs in the plane -- Crushing Disks Efficiently.-Essential Constraints of Edge-Constrained Proximity Graphs -- Plane Bichromatic Trees of Low Degree -- Networks -- Directing Road Networks by Listing Strong Orientations -- Evangelism in Social Networks -- Distance Queries in Large-Scale Fully Dynamic Complex Networks -- Minimax Regret 1-Median Problem in Dynamic Path Networks -- Enumeration -- On Maximal Chain Subgraphs and Covers of Bipartite Graphs -- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations -- Reconfiguration of Steiner Trees in an Unweighted Graph -- Online algorithms -- Weighted Online Problems with Advice -- Finding gapped palindromes online -- Advice Complexity of the Online Search Problem -- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing -- Algorithmic graph theory -- A boundary property for upper domination -- Upper Domination: Complexity and Approximation -- Well-quasi-ordering versus clique-width: new results on bigenic classes -- Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles -- Dynamic programming -- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees -- Speeding up dynamic programming in the line-constrained k-median -- Combinatorial algorithms -- SOBRA - Shielding Optimization for BRAchytherapy -- A bit-scaling algorithm for integer feasibility in UTVPI constraints -- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem -- Exact Algorithms For Weighted Coloring In Special Classes of Tree and Cactus Graphs -- Graph algorithms -- Finding Cactus Roots in Polynomial Time -- Computing Giant Graph Diameters -- Faster Computation of Path-Width -- The Solution Space of Sorting with Recurring Comparison Faults -- Combinatorics -- Monotone paths in geometric triangulations -- On computing the total displacement number via weighted Motzkin paths -- Probabilistics -- Partial Covering Arrays: Algorithms and Asymptotics -- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.
520 ## - SUMMARY, ETC.
Summary, etc. This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016. The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Mathematical logic.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Computer science
Subdivisión general Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Combinatorics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Data Structures.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Término temático o nombre geográfico como elemento de entrada Artificial Intelligence (incl. Robotics).
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Mäkinen, Veli.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Puglisi, Simon J.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Salmela, Leena.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783319445427
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 9843
856 40 - ELECTRONIC LOCATION AND ACCESS
Public note Libro electrónico
Uniform Resource Identifier http://148.231.10.114:2048/login?url=http://dx.doi.org/10.1007/978-3-319-44543-4
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Libro Electrónico
Existencias
Estado de retiro Colección Ubicación permanente Ubicación actual Fecha de ingreso Total Checkouts Date last seen Número de copia Tipo de material
  Colección de Libros Electrónicos Biblioteca Electrónica Biblioteca Electrónica 06/02/2018   06/02/2018 1 Libro Electrónico

Con tecnología Koha