Search Results - "approximation polynomial-time algorithm"

An approximation polynomial-time algorithm for a sequence bi-clustering problem by Kel’manov, A. V., Khamidullin, S. A.

“…We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum…”
Get full text

An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem by Kel'manov, Alexander, Motkova, Anna

“…We consider the strongly NP-hard problem of partitioning a set of Euclidean points into two clusters so as to minimize the sum over both clusters of the…”
Get full text

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications by Oda, Masaki, Kawabata, Akio, Oki, Eiji

“…This letter proposes two polynomial-time approximation algorithms for allocating servers to design a consistency-aware multi-server network for delay-sensitive…”
Get full text

Rescheduling with new orders and general maximum allowable time disruptions by Zhao, Qiulan, Lu, Lingfa, Yuan, Jinjiang

“…We study the rescheduling with new orders on a single machine under the general maximum allowable time disruptions. Under the restriction of general maximum…”
Get full text

Rescheduling problems with allowing for the unexpected new jobs arrival by Zhang, Xingong, Lin, Win-Chin, Wu, Chin-Chia

“…In modern manufacturing and services, rescheduling frequently happens in manufacturing practice, which a disruption may happen. In this paper, the rescheduling…”
Get full text

Edge ranking of weighted trees by Dereniowski, Dariusz

“… Note that the same problem but for trees is linearly solvable. We give an O ( log n ) -approximation polynomial time algorithm for edge ranking of weighted trees…”
Get full text

Approximating Width Parameters of Hypergraphs with Excluded Minors by Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.

“…The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph…”
Get full text

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results by Karthik, C S, Pasin Manurangsi

“…The field of combinatorial reconfiguration studies search problems with a focus on transforming one feasible solution into another. Recently, Ohsaka [STACS'23]…”
Get full text

On Approximability of Steiner Tree in \(\ell_p\)-metrics by Fleischmann, Henry, Gavva, Surya Teja, Karthik, C S

“…In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree…”
Get full text

Finding Short Synchronizing Words for Prefix Codes by Ryzhikov, Andrew, Szykuła, Marek

“…\)-approximation polynomial time algorithm under the assumption P \(\ne\) NP, and by \(n\) the number…”
Get full text

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling by Jahanjou, Hamidreza, Kantor, Erez, Rajaraman, Rajmohan

“…Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed…”
Get full text

Approximating acyclicity parameters of sparse hypergraphs by Fomin, Fedor V, Golovach, Petr A, Thilikos, Dimitrios M

“…The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph…”
Get full text

Ego-Network Segmentation via (Weighted) Jaccard Median by Zhong, Haodi, Loukides, Grigorios, Conte, Alessio, Pissis, Solon P.

“…An ego-network is a graph representing the interactions of a node ( ego ) with its neighbors and the interactions among those neighbors. A sequence of…”
Get full text

Polynomial-time approximation algorithms for the coloring problem in some cases by Malyshev, D. S.

“… For the problem and the open three cases, we present approximation polynomial-time algorithms with performance guarantees…”
Get full text

Jaccard Median for Ego-network Segmentation by Zhong, Haodi, Loukides, Grigorios, Conte, Alessio, Pissis, Solon P.

“…An ego-network is a graph representing the interactions of a node (ego) with its neighbors and the interactions among those neighbors. A sequence of…”
Get full text

Fair Graphical Resource Allocation with Matching-Induced Utilities by Chen, Zheng, Li, Bo, Li, Minming, Zhang, Guochuan

“… For homogeneous agents, we design constant-approximation polynomial-time algorithms, and also note that significant amount of social welfare is sacrificed inevitably in order to ensure (approximate) MMS fairness…”
Get full text

Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule by Li, Bo, Wu, Xiaowei, Xu, Chenyang, Zhang, Ruilong

“… We first show that this problem is NP-hard and does not admit better than \(((1-o(1))\ln k)\)-approximation polynomial-time algorithms unless P…”
Get full text

Bidder Subset Selection Problem in Auction Design by Bei, Xiaohui, Gravin, Nick, Lu, Pinyan, Zhihao Gavin Tang

“…), we give constant approximation polynomial time algorithms in both frameworks (in the latter framework under mild assumptions about the market…”
Get full text

Non-Preemptive Min-Sum Scheduling with Resource Augmentation by Bansal, Nikhil, Chan, Ho-Leung, Khandekar, Rohit, Pruhs, Kirk, Schieber, Baruch, Stein, Cliff

“…We give the first O(l)-speed O(l) approximation polynomial-time algorithms for several nonpreemptive min-sum scheduling problems where jobs arrive over time and must be processed on one machine…”
Get full text