Algorithms and Computation

Name: Algorithms and Computation
SKU: 9783540771180
Price: 1139 SEK
Availability: InStock
Author: Takeshi Tokuyama
ISBN: 9783540771180

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings

AvTakeshi Tokuyama

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

1 139 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

556 kr

1 106 kr

556 kr

1 139 kr

1 139 kr

1 139 kr

1 139 kr

573 kr

1 139 kr

1 139 kr

Beskrivning

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007. The 77 revised full papers presented together with two invited talks were carefully reviewed and selected from 220 submissions. The papers included topical sections on graph algorithms, computational geometry, complexity, graph drawing, distributed algorithms, optimization, data structure, and game theory.

Produktinformation

Utgivningsdatum:2007-11-29
Mått:155 x 235 x 51 mm
Vikt:1 410 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:929
Upplaga:2007
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540771180

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Invited Talk.- Modeling and Analyzing Massive Terrain Data Sets.- Coloring Triangle-Free Graphs on Surfaces.- Best Paper Award Presentation.- Integer Representation and Counting in the Bit Probe Model.- 1A Graph Algorithms I.- Minimum Degree Orderings.- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.- Dynamic Distance Hereditary Graphs Using Split Decomposition.- Unifying Two Graph Decompositions with Modular Decomposition.- 1B Computational Geometry I.- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.- Geometric Spanner of Segments.- Dilation-Optimal Edge Deletion in Polygonal Cycles.- 2A Complexity I.- Unbounded-Error Classical and Quantum Communication Complexity.- A Spectral Method for MAX2SAT in the Planted Solution Model.- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices.- The 1-Versus-2 Queries Problem Revisited.- 2B Graph Drawing.- Approximating the Crossing Number of Toroidal Graphs.- Width-Optimal Visibility Representations of Plane Graphs.- Computing Upward Topological Book Embeddings of Upward Planar Digraphs.- Algorithms for the Hypergraph and the Minor Crossing Number Problems.- 3A Distributed Algorithms.- On Mixing and Edge Expansion Properties in Randomized Broadcasting.- Linear Reconfiguration of Cube-Style Modular Robots.- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks.- Sensor Network Gossiping or How to Break the Broadcast Lower Bound.- On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem.- 3B Optimization I.- Capacitated Domination Problem.- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.- New Bounds for the Nearly EquitableEdge Coloring Problem.- Approximation to the Minimum Cost Edge Installation Problem.- Approximability of Packing Disjoint Cycles.- 4A Data Structure I.- Succinct Representation of Labeled Graphs.- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding.- Kinetic Maintenance of Mobile k-Centres on Trees.- Checking Value-Sensitive Data Structures in Sublinear Space.- 4B Game Theory.- Manipulation in Games.- Using Nash Implementation to Achieve Better Frugality Ratios.- The Price of Nash Equilibria in Multicast Transmissions Games.- 5A Database Applications.- An Efficient Algorithm for Enumerating Pseudo Cliques.- Fast Adaptive Diagnosis with a Minimum Number of Tests.- Dynamic Structures for Top-k Queries on Uncertain Data.- Separating Populations with Wide Data: A Spectral Analysis.- 5B Online Algorithms.- A Constant-Competitive Algorithm for Online OVSF Code Assignment.- Average-Case Analysis of Online Topological Ordering.- Energy Efficient Deadline Scheduling in Two Processor Systems.- On the Relative Dominance of Paging Algorithms.- 6A I/O Algorithms.- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.- Geometric Streaming Algorithms with a Sorting Primitive.- External Memory Range Reporting on a Grid.- Approximate Range Searching in External Memory.- 6B Networks.- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences.- Hardness and Approximation of Traffic Grooming.- Depth of Field and Cautious-Greedy Routing in Social Networks.- Locating Facilities on a Network to Minimize Their Average Service Radius.- 7A Optimization II.- Faster Combinatorial Algorithms for Determinant and Pfaffian.- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.-The Parameterized Complexity of the Unique Coverage Problem.- Bounded Tree-Width and CSP-Related Problems.- 7B Computational Geometry II.- Covering Points by Unit Disks of Fixed Location.- Geodesic Disks and Clustering in a Simple Polygon.- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.- Optimal Triangulation with Steiner Points.- 8A Geometric Applications.- New Algorithm for Field Splitting in Radiation Therapy.- In-Place Algorithm for Image Rotation.- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction.- 8B Data Structures II.- Distributed Relationship Schemes for Trees.- Fast Evaluation of Union-Intersection Expressions.- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem.- 9A Computational Geometry III.- Compressing Spatio-temporal Trajectories.- Finding Popular Places.- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.- 9B Complexity II.- The Monomial Ideal Membership Problem and Polynomial Identity Testing.- On the Fault Testing for Reversible Circuits.- The Space Complexity of k-Tree Isomorphism.- 10A String.- Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.- Space Efficient Indexes for String Matching with Don’t Cares.- 2-Stage Fault Tolerant Interval Group Testing.- Approximate String Matching with Swap and Mismatch.- 10B Graph Algorithms II.- Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs.- Weighted Treewidth Algorithmic Techniques and Results.- Spanning Trees with Many Leaves in Regular Bipartite Graphs.- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.

Mer från samma författare

Computing and Combinatorics

Takeshi Tokuyama, Shin-ichi Nakano, D.T. Lee, Hiroshi Imai, Takao Asano

E-bok

2003

718 kr

Computing and Combinatorics

Takao Asano, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama

Häftad, 1999

573 kr

Algorithms and Computation

Takeshi Tokuyama

E-bok

2007

1 427 kr

WALCOM: Algorithms and Computation

Subir Kumar Ghosh, Takeshi Tokuyama

Häftad, 2013

556 kr

WALCOM: Algorithms and Computation

Takeshi Tokuyama, Subir Kumar Ghosh

E-bok

2013

718 kr

Beyond Planar Graphs

Seok-Hee Hong, Takeshi Tokuyama

Inbunden, 2020

1 106 kr

Beyond Planar Graphs

Takeshi Tokuyama, Seok-Hee Hong

E-bok

2020

1 427 kr

Beyond Planar Graphs

Seok-Hee Hong, Takeshi Tokuyama

Häftad, 2021

1 106 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

556 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

935 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

573 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

845 kr

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott - Biomimetic and Biohybrid Systems, Häftad

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 026 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

573 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 026 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

935 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Del 16923

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

732 kr

Du kanske också är intresserad av

10% rabatt på allt

Exit Adventskalender - Julens magi (SE)

Exit

(1)

499 kr

Algorithms and Computation

Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park

Häftad, 2010

573 kr

Algorithms and Computation

Kyung-Yong Chwa, Oscar H. Ibarra

Häftad, 1998

573 kr

Algorithms and Computation

Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee

Häftad, 2012

556 kr

Algorithms and Computation

Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri

Häftad, 1996

573 kr

Algorithms and Computation

Hon Wai Leong, Hiroshi Imai, Sanjay Jain

Häftad, 1997

573 kr

Algorithms and Computation

Rudolf Fleischer, Gerhard Trippen

Häftad, 2004

1 139 kr

Algorithms and Computation

Prosenjit K. Bose, Pat Morin

Häftad, 2002

556 kr

Del 8889

Algorithms and Computation

Hee-Kap Ahn, Chan-Su Shin

Häftad, 2014

1 106 kr

Algorithms and Computation

Khaled Elbassioni, Kazuhisa Makino

Häftad, 2015

974 kr

Algorithms and Computation

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings

AvTakeshi Tokuyama

Häftad, Engelska, 2007

Del i serien Lecture Notes in Computer Science

1 139 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

556 kr

1 106 kr

556 kr

1 139 kr

1 139 kr

1 139 kr

1 139 kr

573 kr

1 139 kr

1 139 kr

Beskrivning

Produktinformation

Utgivningsdatum:2007-11-29
Mått:155 x 235 x 51 mm
Vikt:1 410 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:929
Upplaga:2007
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540771180

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Invited Talk.- Modeling and Analyzing Massive Terrain Data Sets.- Coloring Triangle-Free Graphs on Surfaces.- Best Paper Award Presentation.- Integer Representation and Counting in the Bit Probe Model.- 1A Graph Algorithms I.- Minimum Degree Orderings.- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.- Dynamic Distance Hereditary Graphs Using Split Decomposition.- Unifying Two Graph Decompositions with Modular Decomposition.- 1B Computational Geometry I.- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.- Geometric Spanner of Segments.- Dilation-Optimal Edge Deletion in Polygonal Cycles.- 2A Complexity I.- Unbounded-Error Classical and Quantum Communication Complexity.- A Spectral Method for MAX2SAT in the Planted Solution Model.- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices.- The 1-Versus-2 Queries Problem Revisited.- 2B Graph Drawing.- Approximating the Crossing Number of Toroidal Graphs.- Width-Optimal Visibility Representations of Plane Graphs.- Computing Upward Topological Book Embeddings of Upward Planar Digraphs.- Algorithms for the Hypergraph and the Minor Crossing Number Problems.- 3A Distributed Algorithms.- On Mixing and Edge Expansion Properties in Randomized Broadcasting.- Linear Reconfiguration of Cube-Style Modular Robots.- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks.- Sensor Network Gossiping or How to Break the Broadcast Lower Bound.- On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem.- 3B Optimization I.- Capacitated Domination Problem.- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.- New Bounds for the Nearly EquitableEdge Coloring Problem.- Approximation to the Minimum Cost Edge Installation Problem.- Approximability of Packing Disjoint Cycles.- 4A Data Structure I.- Succinct Representation of Labeled Graphs.- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding.- Kinetic Maintenance of Mobile k-Centres on Trees.- Checking Value-Sensitive Data Structures in Sublinear Space.- 4B Game Theory.- Manipulation in Games.- Using Nash Implementation to Achieve Better Frugality Ratios.- The Price of Nash Equilibria in Multicast Transmissions Games.- 5A Database Applications.- An Efficient Algorithm for Enumerating Pseudo Cliques.- Fast Adaptive Diagnosis with a Minimum Number of Tests.- Dynamic Structures for Top-k Queries on Uncertain Data.- Separating Populations with Wide Data: A Spectral Analysis.- 5B Online Algorithms.- A Constant-Competitive Algorithm for Online OVSF Code Assignment.- Average-Case Analysis of Online Topological Ordering.- Energy Efficient Deadline Scheduling in Two Processor Systems.- On the Relative Dominance of Paging Algorithms.- 6A I/O Algorithms.- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.- Geometric Streaming Algorithms with a Sorting Primitive.- External Memory Range Reporting on a Grid.- Approximate Range Searching in External Memory.- 6B Networks.- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences.- Hardness and Approximation of Traffic Grooming.- Depth of Field and Cautious-Greedy Routing in Social Networks.- Locating Facilities on a Network to Minimize Their Average Service Radius.- 7A Optimization II.- Faster Combinatorial Algorithms for Determinant and Pfaffian.- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.-The Parameterized Complexity of the Unique Coverage Problem.- Bounded Tree-Width and CSP-Related Problems.- 7B Computational Geometry II.- Covering Points by Unit Disks of Fixed Location.- Geodesic Disks and Clustering in a Simple Polygon.- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.- Optimal Triangulation with Steiner Points.- 8A Geometric Applications.- New Algorithm for Field Splitting in Radiation Therapy.- In-Place Algorithm for Image Rotation.- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction.- 8B Data Structures II.- Distributed Relationship Schemes for Trees.- Fast Evaluation of Union-Intersection Expressions.- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem.- 9A Computational Geometry III.- Compressing Spatio-temporal Trajectories.- Finding Popular Places.- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.- 9B Complexity II.- The Monomial Ideal Membership Problem and Polynomial Identity Testing.- On the Fault Testing for Reversible Circuits.- The Space Complexity of k-Tree Isomorphism.- 10A String.- Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.- Space Efficient Indexes for String Matching with Don’t Cares.- 2-Stage Fault Tolerant Interval Group Testing.- Approximate String Matching with Swap and Mismatch.- 10B Graph Algorithms II.- Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs.- Weighted Treewidth Algorithmic Techniques and Results.- Spanning Trees with Many Leaves in Regular Bipartite Graphs.- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.

Mer från samma författare

Computing and Combinatorics

Takeshi Tokuyama, Shin-ichi Nakano, D.T. Lee, Hiroshi Imai, Takao Asano

E-bok

2003

718 kr

Computing and Combinatorics

Takao Asano, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama

Häftad, 1999

573 kr

Algorithms and Computation

Takeshi Tokuyama

E-bok

2007

1 427 kr

WALCOM: Algorithms and Computation

Subir Kumar Ghosh, Takeshi Tokuyama

Häftad, 2013

556 kr

WALCOM: Algorithms and Computation

Takeshi Tokuyama, Subir Kumar Ghosh

E-bok

2013

718 kr

Beyond Planar Graphs

Seok-Hee Hong, Takeshi Tokuyama

Inbunden, 2020

1 106 kr

Beyond Planar Graphs

Takeshi Tokuyama, Seok-Hee Hong

E-bok

2020

1 427 kr

Beyond Planar Graphs

Seok-Hee Hong, Takeshi Tokuyama

Häftad, 2021

1 106 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

556 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

935 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

573 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

845 kr

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 026 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

573 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 026 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

935 kr

Nyhet

Del 16923

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

732 kr