Merkzettel Warenkorb
Produktbild: Combinatorial Algorithms
Band 10979

Combinatorial Algorithms 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

04.07.2018

Herausgeber

Costas Iliopoulos + weitere

Verlag

Springer

Seitenzahl

388

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

616 g

Auflage

1st ed. 2018

Sprache

Englisch

ISBN

978-3-319-94666-5

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

04.07.2018

Herausgeber

Verlag

Springer

Seitenzahl

388

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

616 g

Auflage

1st ed. 2018

Sprache

Englisch

ISBN

978-3-319-94666-5

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Combinatorial Algorithms

  • Some Recent New Directions in Multivariate Algorithmics.- Survey of some recent near polynomial time results for Parity Games.- Range Minimum Queries and Applications.- Collision-free Routing Problem with Restricted L-path.- Linear clique-width of bi-complement reducible graphs.- Linear Ramsey numbers.- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families.- Minimum Polygons for Fixed Visibility VC-Dimension.- Minsum k-Sink Problem on Dynamic Flow Path Networks.- Fully leafed induced subtrees.- Pattern matching for k--track permutations.- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs.- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.- Covering with Clubs: Complexity and Approximability.- On the Expected Number of Distinct Gapped Palindromic Factors.- Computational Complexity of Robot Arm Simulation Problems.- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation.- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem.- Structural Parameterizations for Colorful Components.- Analysis of Information Leakage due to Operative Errors in Card-based Protocols.- Zero-Suppression and Computation Models.- The Crossing Number of Seq-Shellable Drawings of Complete Graphs.- Cryptographic limitations on polynomial-time a posteriori query learning.- Placing Segments On Parallel Arcs.- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem.- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression.- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation.- Separating Interaction Effects Using Locating and Detecting Arrays.- An Efficient Representation of Partitions of Integers.- How far from a worst solution a random solution of a k-CSP instance can be?.

    ¿