Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I > Some Variations on Constrained Minimum Enclosing Circle Problem
Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I |
Weili Wu; Ovidiu Daescu
Springer Berlin Heidelberg
Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I
Some Variations on Constrained Minimum Enclosing Circle Problem
Authors

Arindam Karmakar; Sandip Das; Subhas C. Nandy; Binay K. Bhattacharya

ARI Id

1664705055631_2820387

Access

Not Available Free

Pages

354-368

DOI

10.1007/978-3-642-17458-2_29

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-17458-2_29

Table of Contents of Book
Showing 1 to 20 of 35 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Termination of Multipartite Graph Series Arising from Complex Network Modelling
Matthieu Latapy; Thi Ha Duong Phan; Christophe Crespelle; Thanh Qui Nguyen
1-10
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
Andreas Emil Feldmann; Shantanu Das; Peter Widmayer
11-20
Evacuation of Rectilinear Polygons
Sándor Fekete; Chris Gray; Alexander Kröller
21-30
A Fast Algorithm for Powerful Alliances in Trees
Ararat Harutyunyan
31-40
NP-Completeness of Spreading Colored Points
Ovidiu Daescu; Wenqi Ju; Jun Luo
41-50
Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
Loreto Gonzalez-Hernandez; Nelson Rangel-Valdez; Jose Torres-Jimenez
51-64
Feasibility-Based Bounds Tightening via Fixed Points
Pietro Belotti; Sonia Cafieri; Jon Lee; Leo Liberti
65-76
A Characterisation of Stable Sets in Games with Transitive Preference
Takashi Matsuhisa
77-84
Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering
Yi Shi; Maryam Hasan; Zhipeng Cai; Guohui Lin; Dale Schuurmans
85-103
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
Bielecki Wlodzimierz; Klimek Tomasz; Palkowski Marek; Anna Beletska
104-113
Bases of Primitive Nonpowerful Sign Patterns
Guanglong Yu; Zhengke Miao; Jinlong Shu
114-127
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures
David Eppstein; Michael T. Goodrich; Darren Strash; Lowell Trott
128-141
Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
Yakov Zinder; Julia Memar; Gaurav Singh
142-156
Finding Strong Bridges and Strong Articulation Points in Linear Time
Giuseppe F. Italiano; Luigi Laura; Federico Santaroni
157-169
Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
Neng Fan; Panos M. Pardalos
170-183
An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs
Vamsi Kundeti; Sanguthevar Rajasekaran; Heiu Dinh
184-196
On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
Yilin Shen; Dung T. Nguyen; My T. Thai
197-211
Cyclic Vertex Connectivity of Star Graphs
Zhihua Yu; Qinghai Liu; Zhao Zhang
212-221
The Number of Shortest Paths in the (n, k)-Star Graphs
Eddie Cheng; Ke Qiu; Zhi Zhang Shen
222-236
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 35 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings