default search action
9th COCOA 2015: Houston, TX, USA
- Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du:
Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. Lecture Notes in Computer Science 9486, Springer 2015, ISBN 978-3-319-26625-1
Classic Combinatorial Optimization
- Gopinath Mishra, Subhra Mazumdar
, Arindam Pal:
Improved Algorithms for the Evacuation Route Planning Problem. 3-19 - Chao Xu, Jianer Chen, Jianxin Wang:
Improved MaxSAT Algorithms for Instances of Degree 3. 20-30 - Frank Gurski
Directed Pathwidth and Palletizers. 31-44 - Jing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting:
Black and White Bin Packing Revisited. 45-59 - Yishui Wang, Dachuan Xu
Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties. 60-71 - Yicheng Xu, Dachuan Xu
A (5.83 + ϵ)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties. 72-81 - Hamed Fahimi
Variants of Multi-resource Scheduling Problems with Equal Processing Times. 82-97
Geometric Optimization
- Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu:
The Discrete and Mixed Minimax 2-Center Problem. 101-109 - Binay K. Bhattacharya, Ante Custic
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. 110-125 - Apurva Mudgal, Supantha Pandit:
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line. 126-137 - David Furcy, Scott M. Summers:
Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D. 138-151 - Matias Korman, Sheung-Hung Poon
Line Segment Covering of Cells in Arrangements. 152-162 - Xuehou Tan, Qi Wei:
An Improved On-line Strategy for Exploring Unknown Polygons. 163-177 - Michael Yu. Khachay
Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem. 178-190
Network Optimization
- Gennaro Cordasco
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks. 193-208 - Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas
An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar. 209-220 - Hongwei Du, Rongrong Zhu, Xiaohua Jia
A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks. 221-235 - Cristina Bazgan, Janka Chlebíková
New Insight into 2-Community Structures in Graphs with Applications in Social Networks. 236-250 - Yaning Liu, Hongwei Du, Qiang Ye
WDCS: A Weight-Based Distributed Coordinate System. 251-260 - Antonio Fernández Anta
Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming. 261-278 - Kejia Zhang, Qilong Han, Zhipeng Cai
Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks. 279-292 - Yueshi Wu, Mihaela Cardei:
Distributed Algorithm for Mending Barrier Gaps via Sensor Rotation in Wireless Sensor Networks. 293-304
Applied Optimization
- Dan Yang, Xiaohan He, Liang Song, Hejiao Huang, Hongwei Du:
A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline. 307-318 - Zeqi Song, Hongwei Du, Hejiao Huang, Chuang Liu
Indoor Localization via Candidate Fingerprints and Genetic Algorithm. 319-333 - Zola Donovan, Vahan Mkrtchyan
On Clustering Without Replication in Combinatorial Circuits. 334-347 - K. Alex Mills
On Replica Placement in High-Availability Storage Under Correlated Failure. 348-363 - Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Observing the State of a Smart Grid Using Bilevel Programming. 364-376 - Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection. 377-391
Complexity and Game
- Dongjing Miao, Jianzhong Li, Xianmin Liu, Hong Gao:
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation. 395-408 - Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. 409-423 - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. 424-438 - Akaki Mamageishvili, Matús Mihalák:
Multicast Network Design Game on a Ring. 439-451 - Andrzej Lingas, Mia Persson:
Extreme Witnesses and Their Applications. 452-466 - Gustavo Dias, Leo Liberti:
Orbital Independence in Symmetric Mathematical Programs. 467-480 - Haiyang Wang, Zhenhua Duan, Cong Tian:
Symbolic Model Checking for Alternating Projection Temporal Logic. 481-495
Optimization in Graphs
- Alka Bhushan, Sajith Gopalan:
An I/O Efficient Algorithm for Minimum Spanning Trees. 499-509 - Liying Kang, Jianjie Zhou, Erfang Shan:
The Connected p-Centdian Problem on Block Graphs. 510-520 - Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li
Searching for (near) Optimal Codes. 521-536 - Wei Ding
Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs. 537-550 - Minghui Jiang:
Trees, Paths, Stars, Caterpillars and Spiders. 551-565 - Wenbin Chen, Lingxi Peng, Jianxiong Wang, Fufang Li, Maobin Tang:
Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset. 566-573 - Jessica A. Enright
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. 574-585 - Yuichi Asahiro, Yuya Doi, Eiji Miyano
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. 586-600 - Stephan Beyer
The Influence of Preprocessing on Steiner Tree Approximations. 601-616 - Danjun Huang, Ko-Wei Lih, Wei-Fan Wang:
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. 617-632 - Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
Maximum Independent Set on B_1 B 1 -VPG Graphs. 633-646 - Wei Ding
Approximating the Restricted 1-Center in Graphs. 647-659 - Eunjeong Yi:
The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs. 660-675 - Minghui Jiang, Ge Xia, Yong Zhang:
Edge-Disjoint Packing of Stars and Cycles. 676-687 - Bogdan Armaselu, Ovidiu Daescu:
Dynamic Minimum Bichromatic Separating Circle. 688-697
Miscellaneous
- Yuqing Zhu, Chengyu Sun, Deying Li, Cong Chen
Searching Graph Communities by Modularity Maximization via Convex Optimization. 701-708 - Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
A New Tractable Case of the QAP with a Robinson Matrix. 709-720 - Feifeng Zheng, Longliang Qiao, Ming Liu:
An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals. 721-730 - Guillaume Escamocher, Barry O'Sullivan
On the Minimal Constraint Satisfaction Problem: Complexity and Generation. 731-745 - Tadao Takaoka:
Algebraic Theory on Shortest Paths for All Flows. 746-757 - Kelin Luo
The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings. 758-770 - Hiromitsu Maji, Taisuke Izumi:
Listing Center Strings Under the Edit Distance Metric. 771-782 - Xin Feng
Online Scheduling for Electricity Cost in Smart Grid. 783-793 - Yasushi Kawase, Xin Han, Kazuhisa Makino:
Proportional Cost Buyback Problem with Weight Bounds. 794-808
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: