Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th COCOA 2023: Hawaii, HI, USA - Part I
- Weili Wu
, Jianxiong Guo:
Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14461, Springer 2024, ISBN 978-3-031-49610-3
Optimization in Graphs
- Nathan Cordner, George Kollios:
An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs. 3-15 - Ruxandra Marinescu-Ghemeci, Alexandru Popa, Tiberiu Sîrbu:
Algorithms on a Path Covering Problem with Applications in Transportation. 16-28 - Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges. 29-42 - Stephen Arndt, Josh Ascher, Kirk Pruhs:
An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line. 43-67 - Minati De, Sambhav Khurana, Satyam Singh:
Online Dominating Set and Coloring. 68-81 - Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo Oliveira, Uéverton S. Souza:
Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets. 82-93 - Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha:
Exactly k MSTs: How Many Vertices Suffice? 94-106 - Lucas Magee, Yusu Wang:
Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs. 107-125
Scheduling
- Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo:
Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints. 129-140 - Fei Li, Ningshi Yao:
Two Exact Algorithms for the Packet Scheduling Problem. 141-153 - Christoph Damerius, Peter Kling, Florian Schneider:
Improved Scheduling with a Shared Resource. 154-167 - Zai-Xing Sun, Zhikai Li, Chonglin Gu, Hejiao Huang:
An Energy-Efficient Scheduling Method for Real-Time Multi-workflow in Container Cloud. 168-181
Set-Related Optimization
- Zhiang Zhou, Wenbin Wei, Kequan Zhao:
Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces. 185-195 - Junqi Tan, Dongjing Miao, Pengyu Chen:
The MaxIS-Shapley Value in Perfect Graphs. 196-210 - Oleksiy Al-saadi, Jamie Radcliffe:
Asteroidal Sets and Dominating Paths. 211-225 - Kaiqi Zhang, Siyuan Zhang, Jirun Gao, Hongzhi Wang, Hong Gao, Jianzhong Li:
A Novel Approximation Algorithm for Max-Covering Circle Problem. 226-238 - Syed F. Zaidi, Kevin W. Gutama, Habib M. Ammari:
GAMA: Genetic Algorithm for k-Coverage and Connectivity with Minimum Sensor Activation in Wireless Sensor Networks. 239-251 - Jiang Zhou, Peng Zhang:
Simple Heuristics for the Rooted Max Tree Coverage Problem. 252-264 - Wenzhe Zhang, Shufang Gong, Bin Liu:
Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint. 265-276 - Shaojie Tang:
Data Summarization Beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization. 277-286 - Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia:
Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization. 287-299
Applied Optimization and Algorithm
- Nader H. Bshouty:
Improved Lower Bound for Estimating the Number of Defective Items. 303-315 - Steven Ge, Toshiya Itoh:
Popularity on the Roommate Diversity Problem. 316-329 - Erik Krohn, Alex Pahlow, Zhongxiu Yang:
On Half Guarding Polygons. 330-353 - Anthony Deschênes, Raphaël Boudreault, Vanessa Simard, Jonathan Gaudreault, Claude-Guy Quimper:
Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem. 354-365 - Qian-Ping Gu, Jiajian Leo Liang:
Algorithms for the Ridesharing with Profit Constraint Problem. 366-379 - Jiale Zhang, Xiuqi Huang, Zifeng Liu, Xiaofeng Gao, Guihai Chen:
Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms. 380-391 - Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono:
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. 392-405 - Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa:
The Line-Constrained Maximum Coverage Facility Location Problem. 406-418
Graph Planer and Others
- Takasugu Shigenobu, Naoyuki Kamiyama:
On Connectedness of Solutions to Integer Linear Systems. 421-433 - Jianping Li, Suding Liu, Junran Lichen:
An Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem. 434-445 - Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu:
The Longest Subsequence-Repeated Subsequence Problem. 446-458 - Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Approximation Algorithm for Covering Vertices by 4+-Paths. 459-470 - Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Substring circ-UMFFs. 471-484 - Haitao Xu, Jingru Zhang:
The Two-Center Problem of Uncertain Points on Trees. 485-497 - Caner Mutlu, Ionut Cardei, Mihaela Cardei:
Space-Time Graph Planner for Unsignalized Intersections with CAVs. 498-511 - Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto:
The Two Sheriffs Problem: Cryptographic Formalization and Generalization. 512-523
a service of 
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-06-19 20:47 CEST 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:
