The following pages link to (Q3337223):
Displaying 42 items.
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- On the multi-radius cover problem (Q845720) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Exploiting locality: Approximating sorting buffers (Q925070) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- A new approach for approximating node deletion problems (Q1029021) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- The maximum clique problem (Q1318271) (← links)
- Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Vertex cover in conflict graphs (Q2424881) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- A Primal-Dual Method for Approximating Tree Cover with Two Weights (Q3439142) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- Reoptimization of Weighted Graph and Covering Problems (Q3602840) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Autarkies and Persistencies for QUBO (Q5050145) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5918428) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5925648) (← links)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)
