| Exactly k MSTs: How Many Vertices Suffice?
|
2024 |
Dutta, Apratim |
| Two Exact Algorithms for the Packet Scheduling Problem
|
2024 |
Li, Fei |
| Improved Scheduling with a Shared Resource
|
2024 |
Damerius, Christoph |
| Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces
|
2024 |
Zhou, Zhiang |
| Asteroidal Sets and Dominating Paths
|
2024 |
Al-saadi, Oleksiy |
| Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem
|
2024 |
Deschénes, Anthony |
| Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs
|
2024 |
Hanaka, Tesshu |
| An Approximation Algorithm for Covering Vertices by 4+-Paths
|
2024 |
Gong, Mingyang |
| Space-Time Graph Planner for Unsignalized Intersections with CAVs
|
2024 |
Mutlu, Caner |
| Algorithms on a Path Covering Problem with Applications in Transportation
|
2024 |
Marinescu-Ghemeci, Ruxandra |
| Online Dominating Set and Coloring
|
2024 |
De, Minati |
| An Energy-Efficient Scheduling Method for Real-Time Multi-workflow in Container Cloud
|
2024 |
Sun, Zaixing |
| A Novel Approximation Algorithm for Max-Covering Circle Problem
|
2024 |
Zhang, Kaiqi |
| Simple Heuristics for the Rooted Max Tree Coverage Problem
|
2024 |
Zhou, Jiang |
| Data Summarization Beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization
|
2024 |
Tang, Shaojie |
| GREEDY+MAX: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization
|
2024 |
Tang, Zhongzheng |
| Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint
|
2024 |
Zhang, Wenzhe |
| Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms
|
2024 |
Zhang, Jiale |
| The Longest Subsequence-Repeated Subsequence Problem
|
2024 |
Lafond, Manuel |
| V-Words, Lyndon Words and Substring circ-UMFFs
|
2024 |
Daykin, Jacqueline W. |
Tag hinzufügen