Treffer 1 - 20 von 16.475

1

Densest Subgraph Discovery on Decentralized Graphs with Local Edge Differential Privacy
Tong, Wenping ; Zhou, Yi ; Wang, Yanhao ; et al.
Proceedings of the 34th ACM International Conference on Information and Knowledge Management. :5299-5303

Konferenz
2

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
Cheng, Siu-Wing ; Huang, Haoqiang ; Zhang, Shuo
Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :2329-2340

Konferenz
3

A (2+ε)-Approximation Algorithm for Metric 𝑘-Median
Cohen-Addad, Vincent ; Grandoni, Fabrizio ; Lee, Euiwoong ; et al.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :615-624

Konferenz
4

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
Gao, Chuanchao ; Easwaran, Arvind
2025 IEEE Real-Time Systems Symposium (RTSS) RTSS Real-Time Systems Symposium (RTSS), 2025 IEEE. :175-188 Dec, 2025

Konferenz
5

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
Gao, Chuanchao ; Easwaran, Arvind
Proceedings of the 4th International Workshop on Real-time and IntelliGent Edge computing. :1-6

Konferenz
6

Attacking Community Detection With Bounded Neighborhood Expansion and Edge Augmentation
Hsu, B. ; Lu, C. ; Chang, Y. ; et al.
IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 38(2):872-888 Feb, 2026

Fachzeitschrift
7

A Constant-Approximation Algorithm for Budgeted Sweep Coverage With Mobile Sensors
Liang, W. ; Tang, S. ; Zhang, Z.
IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 34:1777-1788 2026

Fachzeitschrift
8

Efficient Approximation Algorithms for Server Allocation to Minimize Total Capacity under Server Failure
Inoue, M. ; Oki, E.
IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. 75(1):335-349 Jan, 2026

Fachzeitschrift
9

Decoherence-Aware Entangling and Swapping Strategy Optimization for Entanglement Routing in Quantum Networks
Huang, S. ; Cheng, C. ; Chien, M. ; et al.
IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 34:1300-1315 2026

Fachzeitschrift
10

Optimal Partitioning of Traffic Demand for Coflow Scheduling in Hybrid Switches
Wang, X. ; Shen, H. ; Tian, H.
IEEE Transactions on Network and Service Management IEEE Trans. Netw. Serv. Manage. Network and Service Management, IEEE Transactions on. 22(6):5972-5986 Dec, 2025

Fachzeitschrift
11

Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
Yao, C. ; Guo, C. ; Zhang, W. ; et al.
IEEE Transactions on Network and Service Management IEEE Trans. Netw. Serv. Manage. Network and Service Management, IEEE Transactions on. 22(6):5550-5563 Dec, 2025

Fachzeitschrift
12

Approximation Algorithms for Scheduling With/Without Deadline Constraints Where Rejection Costs are Proportional to Processing Times
Beaumont, O. ; Bouzel, R. ; Eyraud-Dubois, L. ; et al.
IEEE Transactions on Parallel and Distributed Systems IEEE Trans. Parallel Distrib. Syst. Parallel and Distributed Systems, IEEE Transactions on. 36(12):2596-2608 Dec, 2025

Fachzeitschrift
13

Large-Scale Data Retrieve in Road Networks With Optimized $k$-Retriever Routing
Hsu, B. ; Chen, P. ; Chen, C.
IEEE Transactions on Computational Social Systems IEEE Trans. Comput. Soc. Syst. Computational Social Systems, IEEE Transactions on. 12(6):4051-4066 Dec, 2025

Fachzeitschrift
14
15

Approximation Algorithms for Solving the Generalized $P$-Steiner Forest Problem
Fu, Yao ; Zhang, Tongquan ; Wang, Wencheng
2025 9th International Workshop on Control Engineering and Advanced Algorithms (IWCEAA) Control Engineering and Advanced Algorithms (IWCEAA), 2025 9th International Workshop on. :286-290 Oct, 2025

Konferenz
16

2-Approximation for Prize-Collecting Steiner Forest
Ahmadi, Ali ; Gholami, Iman ; Hajiaghayi, MohammadTaghi ; et al.
Journal of the ACM. 72(2):1-27

Fachzeitschrift
17

An improved approximation algorithm for Hypergraph Max p-Section: An improved approximation algorithm for hypergraph max \(p\)-section
Li, Guangfeng ; Sun, Jian ; Gao, Jiaquan ; et al.
Discrete Applied Mathematics. 377:102-112

hypergraph max \(p\)-sec... porcupine rounding Semidefinite programming Programming involving gr... semidefinite programming Hypergraphs
Fachzeitschrift
18

DPconv: Super-Polynomially Faster Join Ordering
Stoian, Mihail ; Kipf, Andreas
Proceedings of the ACM on Management of Data - SIGMOD. 2(6):1-26

Fachzeitschrift
19

KPath: Dependent and Redundant Task Execution Path Planning in Edge Service Networks
Shi, H. ; He, Q. ; Xia, X. ; et al.
IEEE Transactions on Services Computing IEEE Trans. Serv. Comput. Services Computing, IEEE Transactions on. 18(6):3959-3972 Jan, 2025

Fachzeitschrift
20

A Node Deployment Strategy in Solar Insecticidal Lamps Internet of Things With Respect to Partial Coverage and Energy Harvesting Requirements
Yang, F. ; Tian, X. ; Zhang, Z. ; et al.
IEEE Transactions on Sustainable Computing IEEE Trans. Sustain. Comput. Sustainable Computing, IEEE Transactions on. 10(6):1147-1157 Jan, 2025

Fachzeitschrift

Filter