Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18--20, 2010. Proceedings, Part II
The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1165.68007). For Part I of the present conference see Zbl 1203.68018. Indexed articles: \textit{Ballinger, Brad; Benbernou, Nadia; Bose, Prosenjit; Damian, Mirela; Demaine, Erik D.; Dujmović, Vida; Flatland, Robin; Hurtado, Ferran; Iacono, John; Lubiw, Anna; Morin, Pat; Sacristán, Vera; Souvaine, Diane; Uehara, Ryuhei}, Coverage with \(k\)-transmitters in the presence of obstacles, 1-15 [Zbl 1311.90116] \textit{Bollig, Beate}, On symbolic OBDD-based algorithms for the minimum spanning tree problem, 16-30 [Zbl 1311.05183] \textit{Chen, Xujin; Hu, Xiaodong; Ma, Weidong}, Reducing the maximum latency of selfish ring routing via pairwise cooperations, 31-45 [Zbl 1310.91037] \textit{Li, Deying; Li, Zheng; Ma, Wenkai; Chen, Hong}, Constrained surface-level gateway placement for underwater acoustic wireless sensor networks, 46-57 [Zbl 1311.90063] \textit{Balamohan, Balasingham; Flocchini, Paola; Miri, Ali; Santoro, Nicola}, Time optimal algorithms for black hole search in rings, 58-71 [Zbl 1311.90060] \textit{Dobrev, Stefan; Kranakis, Evangelos; Krizanc, Danny; Opatrny, Jaroslav; Ponce, Oscar Morales; Stacho, Ladislav}, Strong connectivity in sensor networks with given number of directional antennae of bounded angle, 72-86 [Zbl 1311.90024] \textit{Olsen, Martin; Viglas, Anastasios; Zvedeniouk, Ilia}, A constant-factor approximation algorithm for the link building problem, 87-96 [Zbl 1310.68034] \textit{Chebotko, Artem; Fu, Bin}, XML reconstruction view selection in XML databases: complexity analysis and approximation scheme, 97-106 [Zbl 1310.68072] \textit{Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua}, Computational study for planar connected dominating set problem, 107-116 [Zbl 1311.05194] \textit{Damaschke, Peter; Muhammad, Azam Sheikh}, Bounds for nonadaptive group tests to estimate the amount of defectives, 117-130 [Zbl 1310.68089] \textit{Otsuki, Tomoshi; Aisu, Hideyuki; Tanaka, Toshiaki}, A search-based approach to the railway rolling stock allocation problem, 131-143 [Zbl 1311.90014] \textit{Nguyen, Viet Hung}, Approximation algorithm for the minimum directed tree cover, 144-159 [Zbl 1310.68246] \textit{He, Jing; Liang, Hongyu}, An improved approximation algorithm for spanning star forest in dense graphs, 160-169 [Zbl 1310.68241] \textit{Liu, Guizhen; Pan, Xuejun; Sun, Jonathan Z.}, A new result on \([k,k + 1]\)-factors containing given Hamiltonian cycles, 170-180 [Zbl 1311.05164] \textit{Damian, Mirela; Raudonis, Kristin}, Yao graphs span Theta graphs, 181-194 [Zbl 1311.05038] \textit{Takaoka, Tadao; Hashim, Mashitoh}, A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time, 195-206 [Zbl 1311.05196] \textit{Busch, Arthur H.; Dragan, Feodor F.; Sritharan, R.}, New min-max theorems for weakly chordal and dually chordal graphs, 207-218 [Zbl 1311.05159] \textit{Wu, Bang Ye}, A simpler and more efficient algorithm for the next-to-shortest path problem, 219-227 [Zbl 1311.05197] \textit{Yang, Boting}, Fast edge-searching and related problems, 228-242 [Zbl 1310.91048] \textit{Ding, Wei; Lin, Guohui; Xue, Guoliang}, Diameter-constrained Steiner tree, 243-253 [Zbl 1311.90119] \textit{D'Angelo, Gianlorenzo; Di Stefano, Gabriele; Navarra, Alfredo}, Minimizing the maximum duty for connectivity in multi-interface networks, 254-267 [Zbl 1311.90022] \textit{Ding, Wei; Xue, Guoliang}, A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree, 268-280 [Zbl 1311.90023] \textit{Li, Deying; Li, Zheng; Ma, Wenkai; Chen, Wenping}, Constrained low-interference relay node deployment for underwater acoustic wireless sensor networks, 281-291 [Zbl 1311.90026] \textit{Fan, Hongbing; Wu, Yu-Liang}, Structured overlay network for file distribution, 292-302 [Zbl 1310.68024] \textit{Kranakis, Evangelos; Krizanc, Danny; Lambadaris, Ioannis; Narayanan, Lata; Opatrny, Jaroslav}, Optimal balancing of satellite queues in packet transmission to ground stations, 303-316 [Zbl 1311.90036] \textit{Tan, Jinsong}, The networked common goods game, 317-331 [Zbl 1310.91047] \textit{Nastos, James; Gao, Yong}, A novel branching strategy for parameterized graph modification problems, 332-346 [Zbl 1310.68191] \textit{Zhuang, Bingbing; Nagamochi, Hiroshi}, Listing triconnected rooted plane graphs, 347-361 [Zbl 1311.05044] \textit{Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei}, Bipartite permutation graphs are reconstructible, 362-373 [Zbl 1258.05082] \textit{Tian, Cong; Duan, Zhenhua}, A transformation from PPTL to S1S, 374-386 [Zbl 1310.68146] \textit{Xiao, Mingyu}, Exact and parameterized algorithms for edge dominating set in 3-degree graphs, 387-400 [Zbl 1311.05198] \textit{Mukhopadhyay, Asish; Sarker, Animesh; Switzer, Tom}, Approximate ellipsoid in the streaming model, 401-413 [Zbl 1310.68245]
scientific article; zbMATH DE number 5827507