The following pages link to Xu-jin Chen (Q403432):
Displayed 50 items.
- (Q390907) (redirect page) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Bonds with parity constraints (Q414634) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- Approximation algorithms for pricing with negative network externalities (Q511718) (← links)
- Deterministic risk control for cost-effective network connections (Q621844) (← links)
- Covering triangles in edge-weighted graphs (Q726109) (← links)
- Schedules for marketing products with negative externalities (Q744100) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- A new model for path planning with interval data (Q1000974) (← links)
- The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
- Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- The equilibrium existence of a robust routing game under interval uncertainty (Q1617665) (← links)
- Mechanism design for two-opposite-facility location games with penalties on distance (Q1617675) (← links)
- Algorithms for the ring star problem (Q1708589) (← links)
- Embedding games with strategic complements into games with strategic substitutes (Q1800967) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- On weak Pareto optimality of nonatomic routing networks (Q2082187) (← links)
- Mechanisms for dual-role-facility location games: truthfulness and approximability (Q2172605) (← links)
- The price of anarchy for the load balancing game with a randomizing scheduler (Q2180139) (← links)
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Stability vs. optimality in selfish ring routing (Q2453835) (← links)
- An efficient algorithm for finding maximum cycle packings in reducible flow graphs (Q2492638) (← links)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← links)
- On the restricted forwarding index problem in communication networks (Q2519637) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game (Q2656357) (← links)
- (Q2721689) (← links)
- Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing (Q2817846) (← links)
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles (Q2819510) (← links)
- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines (Q2856147) (← links)
- Approximability of the Minimum Weighted Doubly Resolving Set Problem (Q2920473) (← links)
- (Q2923563) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Total Dual Integrality of Triangle Covering (Q2958309) (← links)
- Continuous Firefighting on Infinite Square Grids (Q2988819) (← links)
- Cost-effective designs of fault-tolerant access networks in communication systems (Q3057095) (← links)
- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations (Q3066441) (← links)
- Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines (Q3167373) (← links)