Atjaunināt sīkdatņu piekrišanu

E-grāmata: Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II

Edited by , Edited by
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 6509
  • Izdošanas datums: 15-Dec-2010
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783642174612
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 6509
  • Izdošanas datums: 15-Dec-2010
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783642174612

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 1820, 2010. Past COCOA conferences were held in Xian, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.
Coverage with k-Transmitters in the Presence of Obstacles
1(15)
Brad Ballinger
Nadia Benbernou
Prosenjit Bose
Mirela Damian
Erik D. Demaine
Vida Dujmovic
Robin Flatland
Ferran Hurtado
John Iacono
Anna Lubiw
Pat Morin
Vera Sacristan
Diane Souvaine
Ryuhei Uehara
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem
16(15)
Beate Bollig
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations
31(15)
Xujin Chen
Xiaodong Hu
Weidong Ma
Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks
46(12)
Deying Li
Zheng Li
Wenkai Ma
Hong Chen
Time Optimal Algorithms for Black Hole Search in Rings
58(14)
Balasingham Balamohan
Paola Flocchini
Ali Miri
Nicola Santoro
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
72(15)
Stefan Dobrev
Evangelos Kranakis
Danny Krizanc
Jaroslav Opatrny
Oscar Morales Ponce
Ladislav Stacho
A Constant-Factor Approximation Algorithm for the Link Building Problem
87(10)
Martin Olsen
Anastasios Viglas
Ilia Zvedeniouk
XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme
97(10)
Artem Chebotko
Bin Fu
Computational Study for Planar Connected Dominating Set Problem
107(10)
Marjan Marzban
Qian-Ping Gu
Xiaohua Jia
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
117(14)
Peter Damaschke
Azam Sheikh Muhammad
A Search-Based Approach to the Railway Rolling Stock Allocation Problem
131(13)
Tomoshi Otsuki
Hideyuki Aisu
Toshiaki Tanaka
Approximation Algorithm for the Minimum Directed Tree Cover
144(16)
Viet Hung Nguyen
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
160(10)
Jing He
Hongyu Liang
A New Result on [ k, k+1]-Factors Containing Given Hamiltonian Cycles
170(11)
Guizhen Liu
Xuejun Pan
Jonathan Z. Sun
Yao Graphs Span Theta Graphs
181(14)
Mirela Damian
Kristin Raudonis
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2 log n) Expected Time
195(12)
Tadao Takaoka
Mashitoh Hashim
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
207(12)
Arthur H. Busch
Feodor F. Dragan
R. Sritharan
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
219(9)
Bang Ye Wu
Fast Edge-Searching and Related Problems
228(15)
Boting Yang
Diameter-Constrained Steiner Tree
243(11)
Wei Ding
Guohui Lin
Guoliang Xue
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
254(14)
Gianlorenzo D'Angelo
Gabriele Di Stefano
Alfredo Navarra
A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree
268(13)
Wei Ding
Guoliang Xue
Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks
281(11)
Deying Li
Zheng Li
Wenkai Ma
Wenping Chen
Structured Overlay Network for File Distribution
292(11)
Hongbing Fan
Yu-Liang Wu
Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations
303(14)
Evangelos Kranakis
Danny Krizanc
Ioannis Lambadaris
Lata Narayanan
Jaroslav Opatrny
The Networked Common Goods Game
317(15)
Jinsong Tan
A Novel Branching Strategy for Parameterized Graph Modification Problems
332(15)
James Nastos
Yong Gao
Listing Triconnected Rooted Plane Graphs
347(15)
Bingbing Zhuang
Hiroshi Nagamochi
Bipartite Permutation Graphs Are Reconstructible
362(12)
Masashi Kiyomi
Toshiki Saitoh
Ryuhei Uehara
A Transformation from PPTL to SIS
374(13)
Cong Tian
Zhenhua Duan
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
387(14)
Mingyu Xiao
Approximate Ellipsoid in the Streaming Model
401(14)
Asish Mukhopadhyay
Animesh Sarker
Tom Switzer
Author Index 415