Skip to main content

Journal of Combinatorial Optimization

Ausgabe 4/2022

Inhalt (50 Artikel)

A tight approximation algorithm for problem

Yinling Wang, Yan Lan, Xin Chen, Xin Han, Yong Piao

Due date assignment and two-agent scheduling under multitasking environment

Yongjian Yang, Guangqiang Yin, Chunyu Wang, Yunqiang Yin

Principal–agent problem under the linear contract

Guichen Gao, Xinxin Han, Li Ning, Hing-Fung Ting, Yong Zhang

Intersections and circuits in sets of line segments

Boris Brimkov, Jesse Geneson, Alathea Jensen, Jordan Broussard, Pouria Salehi Nowbandegani

The spherical k-means++ algorithm via local search scheme

Xiaoyun Tian, Dachuan Xu, Donglei Du, Ling Gai

1-Attempt parallel thinning

Kálmán Palágyi, Gábor Németh

Open Access

Further steps on the reconstruction of convex polyominoes from orthogonal projections

Paolo Dulio, Andrea Frosini, Simone Rinaldi, Lama Tarsissi, Laurent Vuillon

Data source selection for approximate query

Hongjie Guo, Jianzhong Li, Hong Gao

A data structure for efficiently managing a set of energy functions

Jacques Carlier, Antoine Jouglet, Eric Pinson, Abderrahim Sahli

Approximation algorithms with constant ratio for general cluster routing problems

Xiaoyan Zhang, Donglei Du, Gregory Gutin, Qiaoxia Ming, Jian Sun

Improved local search algorithms for Bregman k-means and its variants

Xiaoyun Tian, Dachuan Xu, Longkun Guo, Dan Wu

Nonsubmodular constrained profit maximization from increment perspective

Liman Du, Shengminjie Chen, Suixiang Gao, Wenguo Yang

Local routing in a tree metric 1-spanner

Milutin Brankovic, Joachim Gudmundsson, André van Renssen

Open Access

Characterizing slope regions

Rocio Gonzalez-Diaz, Darshan Batavia, Rocio M. Casablanca, Walter G. Kropatsch

Open Access

Constructing tree decompositions of graphs with bounded gonality

Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit

Optimal frequency assignment and planar list L(2, 1)-labeling

Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao

1-line minimum rectilinear steiner trees and related problems

Jianping Li, Junran Lichen, Wencheng Wang, Jean Yeh, YeongNan Yeh, Xingxing Yu, Yujie Zheng

Open Access

HM-EIICT: Fairness-aware link prediction in complex networks using community information

Akrati Saxena, George Fletcher, Mykola Pechenizkiy

On the enumeration of minimal non-pairwise compatibility graphs

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi

On the restricted k-Steiner tree problem

Prosenjit Bose, Anthony D’Angelo, Stephane Durocher

TLHSA and SACA: two heuristic algorithms for two variant VRP models

Xuhong Cai, Li Jiang, Songhu Guo, Hejiao Huang, Hongwei Du

Unfolding H-convex Manhattan Towers

Lydie Richaume, Eric Andres, Gaëlle Largeteau-Skapin, Rita Zrour

Open Access

Strong Euler well-composedness

Nicolas Boutry, Rocio Gonzalez-Diaz, Maria-Jose Jimenez, Eduardo Paluzo-Hildago

Premium Partner