Skip to main content
SpringerLink
Log in

Computing and Combinatorics

16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. My T. Thai

    1. University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sartaj Sahni

    1. Department of Computer and Information Science and Technology, University of Florida, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6196)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: COCOON 2010.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (56 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Understanding and Inductive Inference

      • Manuel Blum
      Pages 1-1

    2. Computing with Cells: Membrane Systems

      • Oscar H. Ibarra
      Pages 2-2

  3. Complexity and Inapproximability

    1. Boxicity and Poset Dimension

      • Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
      Pages 3-12

    2. On the Hardness against Constant-Depth Linear-Size Circuits

      • Chi-Jen Lu, Hsin-Lung Wu
      Pages 13-22

    3. A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model

      • Ricky Rosen
      Pages 23-33

    4. The Curse of Connectivity: t-Total Vertex (Edge) Cover

      • Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
      Pages 34-43

    5. Counting Paths in VPA Is Complete for #NC 1

      • Andreas Krebs, Nutan Limaye, Meena Mahajan
      Pages 44-53

    6. Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas

      • Rahul Jain, Hartmut Klauck, Shengyu Zhang
      Pages 54-59

  4. Approximation Algorithms

    1. Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing

      • Anke van Zuylen
      Pages 60-69

    2. Clustering with or without the Approximation

      • Frans Schalekamp, Michael Yu, Anke van Zuylen
      Pages 70-79

    3. A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks

      • Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil
      Pages 80-89

    4. Approximate Weighted Farthest Neighbors and Minimum Dilation Stars

      • John Augustine, David Eppstein, Kevin A. Wortman
      Pages 90-99

    5. Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

      • Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting
      Pages 100-109

  5. Graph Theory and Algorithms

    1. Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph

      • Aimal Rextin, Patrick Healy
      Pages 110-119

    2. Triangle-Free 2-Matchings Revisited

      • Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn
      Pages 120-129

    3. The Cover Time of Deterministic Random Walks

      • Tobias Friedrich, Thomas Sauerwald
      Pages 130-139

    4. Finding Maximum Edge Bicliques in Convex Bipartite Graphs

      • Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh
      Pages 140-149

    5. A Note on Vertex Cover in Graphs with Maximum Degree 3

      • Mingyu Xiao
      Pages 150-159

    6. Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming

      • Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano, Andrea Ribichini
      Pages 160-172
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

Editors and Affiliations

  • University of Florida, Gainesville, USA

    My T. Thai

  • Department of Computer and Information Science and Technology, University of Florida, USA

    Sartaj Sahni

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation