Computing and combinatorics : 11th annual international conference, COCOON 2005, Kunming, China, August 16-29, 2005 : proceedings /
Saved in:
| Meeting name: | COCOON (Conference) (11th : 2005 : Kunming Shi, China) |
|---|---|
| Imprint: | Berlin ; New York : Springer, 2005. |
| Description: | xvi, 995 p. : ill. ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science, 0302-9743 ; 3595 |
| Subject: | Computer science -- Congresses. Combinatorial analysis -- Congresses. Combinatorial analysis. Computer science. Conference papers and proceedings. |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/5711741 |
| LEADER | 13158cam a2200469 a 4500 | ||
|---|---|---|---|
| 001 | 5711741 | ||
| 003 | ICU | ||
| 005 | 20200713110511.9 | ||
| 008 | 050812s2005 gw 101 0 eng d | ||
| 010 | |a 2005929995 | ||
| 020 | |a 3540280618 (pbk.) | ||
| 024 | 3 | |a 9783540280613 | |
| 035 | |a (OCoLC)61263664 | ||
| 040 | |a OHX |c OHX |d BAKER |d CUS |d UtOrBLW |d OrLoB-B | ||
| 049 | |a CGUA | ||
| 072 | 7 | |a QA |2 lcco | |
| 090 | |a QA75.5 |b .C63 2005 | ||
| 111 | 2 | |a COCOON (Conference) |n (11th : |d 2005 : |c Kunming Shi, China) |1 http://viaf.org/viaf/147078179 |0 http://id.loc.gov/authorities/names/nb2005012158 | |
| 245 | 1 | 0 | |a Computing and combinatorics : |b 11th annual international conference, COCOON 2005, Kunming, China, August 16-29, 2005 : proceedings / |c Lusheng Wang (ed.). |
| 246 | 3 | 0 | |a COCOON 2005 |
| 260 | |a Berlin ; |a New York : |b Springer, |c 2005. | ||
| 300 | |a xvi, 995 p. : |b ill. ; |c 24 cm. | ||
| 336 | |a text |b txt |2 rdacontent |0 http://id.loc.gov/vocabulary/contentTypes/txt | ||
| 337 | |a unmediated |b n |2 rdamedia |0 http://id.loc.gov/vocabulary/mediaTypes/n | ||
| 338 | |a volume |b nc |2 rdacarrier |0 http://id.loc.gov/vocabulary/carriers/nc | ||
| 440 | 0 | |a Lecture notes in computer science, |x 0302-9743 ; |v 3595 | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | 0 | |t Completeness for parity problems / |r Leslie G. Valiant -- |t Monotony and surprise / |r Alberto Apostolico -- |t Smoothed analysis of algorithms and heuristics / |r Shang-Hua Teng -- |t Gene network : model, dynamics and simulation / |r Shiquan Wu and Xun Gu -- |t Conserved interval distance computation between non-trivial genomes / |r Guillaume Blin and Romeo Rizzi -- |t RNA multiple structural alignment with longest common subsequences / |r Sergey Bereg and Binhai Zhu -- |t Perfect sorting by reversals / |r Marie-France Sagot and Eric Tannier -- |t Genome rearrangements with partially ordered chromosomes / |r Chunfang Zheng and David Sankoff -- |t Quartet-based phylogeny reconstruction from gene orders / |r Tao Liu, Jijun Tang and Bernard M. E. Moret -- |t Algorithmic and complexity issues of three clustering methods in microarray data analysis / |r Jinsong Tan, Kok Seng Chua and Louxin Zhang -- |t RIATA-HGT : a fast and accurate heuristic for reconstructing horizontal gene transfer / |r Luay Nakhleh, Derek Ruths and Li-San Wang -- |t A new pseudoknots folding algorithm for RNA structure prediction / |r Hengwu Li and Daming Zhu -- |t Rapid homology search with two-stage extension and daughter seeds / |r Miklos Csuros and Bin Ma -- |t On the approximation of computing evolutionary trees / |r Vincent Berry, Sylvain Guillemot, Francois Nicolas and Christophe Paul -- |t Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks / |r Xiang-Yang Li and Peng-Jun Wan -- |t Improved approximation algorithms for the capacitated multicast routing problem / |r Zhipeng Cai, Guohui Lin and Guoliang Xue -- |t Construction of scale-free networks with partial information / |r Jianyang Zeng, Wen-Jing Hsu and Suiping Zhou -- |t Radio networks with reliable communication / |r Yvo Desmedt, Yongge Wang, Rei Safavi-Naini and Huaxiong Wang -- |t Geometric network design with selfish agents / |r Martin Hoefer and Piotr Krysta -- |t Bicriteria network design via iterative rounding / |r Piotr Krysta -- |t Interference in cellular networks : the minimum membership set cover problem / |r Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl and Aaron Zollinger -- |t Routing and coloring for maximal number of trees / |r Xujin Chen, Xiaodong Hu and Tianping Shuai -- |t Share the multicast payment fairly / |r WeiZhao Wang, Xiang-Yang Li and Zheng Sun -- |t On packing and coloring hyperedges in a cycle / |r Jianping Li, Kang Li, Ken C. K. Law and Hao Zhao -- |t Fault-tolerant relay node placement in wireless sensor networks / |r Hai Liu, Peng-Jun Wan and Xiaohua Jia -- |t Best fitting fixed-length substring patterns for a set of strings / |r Hirotaka Oho and Yen Kaow Ng -- |t String coding of trees with locality and heritability / |r Saverio Caminiti and Rossella Petreschi -- |t Finding longest increasing and common subsequences in streaming data / |r David Liben-Nowell, Erik Vee and An Zhu -- |t O(n[superscript 2] log n) time on-line construction of two-dimensional suffix trees / |r Joong Chae Na, Raffaele Giancarlo and Kunsoo Park -- |t Min-energy voltage allocation for tree-structured tasks / |r Minming Li, Becky Jie Liu and Frances F. Yao -- |t Semi-online problems on identical machines with inexact partial information / |r Zhiyi Tan and Yong He -- |t On-line simultaneous maximization of the size and the weight for degradable intervals schedules / |r Fabien Baille, Evripidis Bampis, Christian Laforest and Nicolas Thibault -- |t Off-line algorithms for minimizing total flow time in broadcast scheduling / |r Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen and Prudence W. H. Wong -- |t Oblivious and adaptive strategies for the majority and plurality problems / |r Fan Chung, Ron Graham, Jia Mao and Andrew Yao -- |t A note on zero error algorithms having oracle access to one NP query / |r Jin-Yi Cai and Venkatesan T. Chakaravarthy -- |t On the complexity of computing the logarithm and square root functions on a complex domain / |r Ker-I Ko and Fuxiang Yu -- |t Solovay reducibility on D-c.e real numbers / |r Robert Rettinger and Xizhong Zheng -- |t Algorithms for terminal Steiner trees / |r Fabio Viduani Martinez, Jose Coelho de Pina and Jose Soares -- |t Simple distributed algorithms for approximating minimum Steiner trees / |r Parinya Chalermsook and Jittat Fakcharoenphol -- |t A truthful (2 - 2/k)-approximation mechanism for the Steiner tree problem with k terminals / |r Luciano Guala and Guido Proietti -- |t Radial coordinate assignment for level graphs / |r Christian Bachmaier, Florian Fischer and Michael Forster -- |t A theoretical upper bound for IP-based floorplanning / |r Guowu Yang, Xiaoyu Song, Hannah H. Yang and Fei Xie -- |t Quantum noisy rational function reconstruction / |r Sean Hallgren, Alexander Russell and Igor E. Shparlinski -- |t Promised and distributed quantum search / |r Shengyu Zhang -- |t Efficient and simple generation of random simple connected graphs with prescribed degree sequence / |r Fabien Viger and Matthieu Latapy -- |t Randomized quicksort and the entropy of the random source / |r Beatrice List, Markus Maucher, Uwe Schoning and Rainer Schuler -- |t Subquadratic algorithm for dynamic shortest distances / |r Piotr Sankowski -- |t Randomly generating triangulations of a simple polygon / |r Q. Ding, J. Qian, W. Tsang and C. Wang -- |t Triangulating a convex polygon with small number of non-standard bars / |r Yinfeng Xu, Wenqiang Dai, Naoki Katoh and Makoto Ohsaki -- |t A PTAS for a disc covering problem using width-bounded separators / |r Zhixiang Chen, Bin Fu, Yong Tang and Binhai Zhu -- |t Efficient algorithms for intensity map splitting problems in radiation therapy / |r Xiaodong Wu -- |t Distributions of points in d dimensions and large k-point simplices / |r Hanno Lefmann -- |t Exploring simple grid polygons / |r Christian Icking, Tom Kamphans, Rolf Klein and Elmar Langetepe -- |t Approximation algorithms for cutting out polygons with lines and rays / |r Xuehou Tan -- |t Efficient non-intersection queries on aggregated geometric data / |r Prosenjit Gupta, Ravi Janardan and Michiel Smid -- |t An upper bound on the number of rectangulations of a point set / |r Eyal Ackerman, Gill Barequet and Ron Y. Pinter -- |t Opportunistic data structures for range queries / |r Chung Keung Poon and Wai Keung Yiu -- |t Generating combinations by prefix shifts / |r Frank Ruskey and Aaron Williams -- |t Error-set codes and related objects / |r An Braeken, Ventzislav Nikov and Svetla Nikova -- |t On Walrasian price of CPU time / |r Xiaotie Deng, Li-Sha Huang and Minming Li -- |t On-line algorithms for market equilibria / |r Spyros Angelopoulos, Atish Das Sarma, Avner Magen and Anastasios Viglas -- |t Interval subset sum and uniform-price auction clearing / |r Anshul Kothari, Subhash Suri and Yunhong Zhou -- |t Improved algorithms for the K-maximum subarray problem for small K / |r Sung E. Bae and Tadao Takaoka -- |t Server allocation algorithms for tiered systems / |r Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Tarjan and Yunhong Zhou -- |t An improved approximation algorithm for uncapacitated facility location problem with penalties / |r Guang Xu and Jinhui Xu -- |t The reverse greedy algorithm for the metric K-median problem / |r Marek Chrobak, Claire Kenyon and Neal E. Young -- |t On approximate balanced bi-clustering / |r Guoxuan Ma, Jiming Peng and Yu Wei -- |t Toroidal grids are anti-magic / |r Tao-Ming Wang -- |t Optimally balanced forward degree sequence / |r Xiaomin Chen, Mario Szegedy and Lei Wang -- |t Conditionally critical indecomposable graphs / |r Chandan K. Dubey, Shashank K. Mehta and Jitender S. Deogun -- |t A tight analysis of the maximal matching heuristic / |r Jean Cardinal, Martine Labbe, Stefan Langerman, Eythan Levy and Hadrien Melot -- |t New streaming algorithms for counting triangles in graphs / |r Hossein Jowhari and Mohammad Ghodsi -- |t A new approach and faster exact methods for the maximum common subgraph problem / |r W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova and Michael A. Langston -- |t On the power of lookahead in on-line vehicle routing problems / |r Luca Allulli, Giorgio Ausiello and Luigi Laura -- |t Efficient algorithms for simplifying flow networks / |r Ewa Misiolek and Danny Z. Chen -- |
| 505 | 8 | 0 | |t Approximation algorithms for the b-edge dominating set problem and its related problems / |r Takuro Fukunaga and Hiroshi Nagamochi -- |t Bounded degree closest k-tree power is NP-complete / |r Michael Dom, Jiong Guo and Rolf Niedermeier -- |t A new algorithm for the hypergraph transversal problem / |r Leonid Khachiyan, Endre Boros, Khaled Elbassioni and Vladimir Gurvich -- |t On finding a shortest path in circulant graphs with two jumps / |r Domingo Gomez, Jaime Gutierrez, Alvar Ibeas, Carmen Martinez and Ramon Beivide -- |t A linear time algorithm for finding a maximal planar subgraph based on PC-trees / |r Wen-Lian Hsu -- |t Algorithms for finding distance-edge-colorings of graphs / |r Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki -- |t On the recognition of probe graphs of some self-complementary classes of perfect graphs / |r Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu and Sheng-Lung Peng -- |t Power domination problem in graphs / |r Chung-Shou Liao and Der-Tsai Lee -- |t Complexity and approximation of satisfactory partition problems / |r Cristina Bazgan, Zsolt Tuza and Daniel Vanderpooten -- |t Distributed weighted vertex cover via maximal matchings / |r Fabrizio Grandoni, Jochen Konemann and Alessandro Panconesi -- |t On the complexity of the balanced vertex ordering problem / |r Jan Kara, Jan Kratochvil and David R. Wood -- |t An O(2[superscript O(k)]n[superscript 3]) FPT algorithm for the undirected feedback vertex set problem / |r Frank Dehne, Michael Fellows, Michael Langston, Frances Rosamond and Kim Stevens -- |t Approximating the longest cycle problem on graphs with bounded degree / |r Guantao Chen, Zhicheng Gao, Xingxing Yu and Wenan Zang -- |t Bin packing and covering problems with rejection / |r Yong He and Gyorgy Dosa -- |t Query-monotonic turing reductions / |r Lane A. Hemaspaandra and Mayur Thakur -- |t On sequential and 1-deterministic P systems / |r Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen and Zhe Dang -- |t Global optimality conditions and near-perfect optimization in coding / |r Xiaofei Huang -- |t Angel, devil, and king / |r Martin Kutz and Attila Por -- |t Overlaps help : improved bounds for group testing with interval queries / |r Ferdinando Cicalese, Peter Damaschke, Libertad Tansini and Soren Werth -- |t New efficient simple authenticated key agreement protocol / |r Eun-Jun Yoon and Kee-Young Yoo -- |t A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm / |r Zhixiang Chen and Bin Fu -- |t The money changing problem revisited : computing the Frobenius number in time O(k a[subscript 1]) / |r Sebastian Bocker and Zsuzsanna Liptak -- |t W-hardness under linear FPT-reductions : structural properties and further applications / |r Jianer Chen, Xiuzhen Huang, Iyad A. Kanj and Ge Xia -- |t Some new results on inverse sorting problems / |r Xiao Guang Yang and Jian Zhong Zhang. |
| 650 | 0 | |a Computer science |v Congresses. |0 http://id.loc.gov/authorities/subjects/sh2008101220 | |
| 650 | 0 | |a Combinatorial analysis |v Congresses. |0 http://id.loc.gov/authorities/subjects/sh2008101218 | |
| 650 | 7 | |a Combinatorial analysis. |2 fast |0 http://id.worldcat.org/fast/fst00868961 | |
| 650 | 7 | |a Computer science. |2 fast |0 http://id.worldcat.org/fast/fst00872451 | |
| 655 | 7 | |a Conference papers and proceedings. |2 fast |0 http://id.worldcat.org/fast/fst01423772 | |
| 700 | 1 | |a Wang, Lusheng, |d 1962- |0 http://id.loc.gov/authorities/names/no2005100159 |1 http://viaf.org/viaf/105809515 | |
| 901 | |a ToCBNA | ||
| 903 | |a HeVa | ||
| 903 | |a HeVa | ||
| 929 | |a cat | ||
| 999 | f | f | |i 8078e981-6bad-5a32-995b-89cb0ddf70a7 |s ecb04d0b-5391-5e47-8385-a380456db3bf |
| 928 | |t Library of Congress classification |a QA75.5 .C63 2005 |l JCL |c JCL-Sci |i 5066199 | ||
| 927 | |t Library of Congress classification |a QA75.5 .C63 2005 |l JCL |c JCL-Sci |e CRERAR |b 63106632 |i 7893948 | ||
